Abstract
Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.
Similar content being viewed by others
References
Atamtürk, A.: On capacitated network design cut-set polyhedra. Math. Program. 92, 425–437 (2002)
Atamtürk, A.: On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Program. 92, 315–333 (2002)
Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network design. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 311–334. Wiley, New York (1997)
Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 823–837 (1996)
Benders, J.F.: Partitioning procedures for solving mixed variables programming problems. Numer. Math. 4, 238–252 (1962)
Chouman, M., Crainic, T.G., Gendron, B.: A cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design. Publication CRT-316, Centre de recherche sur les transports, Université de Montréal (2003)
Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12, 223–236 (2000)
Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling/lagrangean perturbation heuristic with long-term memory for multicommodity fixed-charge network design. J. Heuristics 10, 525–545 (2004)
Gabrel, V., Knippel, A., Minoux, M.: Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25, 15–23 (1999)
Gendron, B., Crainic, T.G.: Relaxations for multicommodity capacitated network design problems. Publication CRT-965, Centre de recherche sur les transports, Université de Montréal (1994)
Gendron, B., Crainic, T.G.: Bounding procedures for multicommodity capacitated fixed charge network design problems. Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal (1996)
Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Sanso, B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 1–19. Kluwer, Norwell (1999)
Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51, 655–667 (2003)
Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131, 109–133 (2004)
Günlük, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17–39 (1999)
Holmberg, K., Yuan, D.: A lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461–481 (2000)
Kliewer, G., Timajev, L.: Relax-and-cut for capacitated network design. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA). Lecture Notes on Computer Science, vol. 3669, pp. 47–58. Springer, Berlin (2005)
Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transp. Sci. 18, 1–56 (1984)
Minoux, M.: Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313–360 (1989)
Sellman, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. In: Proceedings of the 10th Annual European Symposium on Algorithms (ESA). Lecture Notes on Computer Science, vol. 2461, pp. 845–858. Springer, Berlin (2002)
Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68, 149–167 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Costa, A.M., Cordeau, JF. & Gendron, B. Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput Optim Appl 42, 371–392 (2009). https://doi.org/10.1007/s10589-007-9122-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-007-9122-0