Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs

Lagrangean-based decomposition algorithm

Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints

✍ Tolga Bektaş; Mervat Chouman; Teodor Gabriel Crainic 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

## Abstract This article discusses problems in the context of multicommodity network design where additional constraints (such as capacity), rather than being imposed in a strict manner, are allowed to be violated at the expense of additional penalty costs. Such penalized cost structures allow thes