Decomposition for network design

Exercises

• Exercises 1: February 24-25
• Exercises 2: March 2-3
• Exercises 3: March 9-10

Readings

• Magnanti T.L., Wong R.T. (1984). Network design and transportation planning: Models and algorithms. Transportation Science 18(1) 1-55.
• Crainic T.G. (2000). Service network design in freight transportation. European Journal of Operational Research 122 272-288.
• Frangioni A. (2005). About Lagrangian methods in integer optimization. Annals of Operations Research 139 163-193.
• Costa A. M. (2005). A survey on Benders decomposition applied to fixed-charge network design problems. Computers and Operations Research 32 1429-1450.
• Orman A. J., Williams H. P. (2007). A survey of different integer programming formulations of the traveling salesman problem. Optimisation, Econometric and Financial Analysis, volume 9 of Advances in Computational Management Science, Springer 91-104.
• Barnhart C., Hane C. A., Vance P. H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 318-326.
• Contreras I., Cordeau J. F., Laporte G. (2011). Benders decomposition for large-scale uncapacitated hub location. Operations Research 59 1477-1490.
• Chouman M., Crainic T. G., Gendron B. (2016). Commodity representations and cutset-based inequalities for multicommodity capacitated fixed-charge network design. Transportation Science forthcoming.
• Gendron B., Larose M. (2014). Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO Journal on Computational Optimization 2 55-75.
• Frangioni A., Gendron B. (2009). 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Applied Mathematics 157 1229-1241.