{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:51:22Z","timestamp":1771235482829,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10589-007-9122-0","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T12:00:18Z","timestamp":1193745618000},"page":"371-392","source":"Crossref","is-referenced-by-count":57,"title":["Benders, metric and cutset inequalities for\u00a0multicommodity capacitated network\u00a0design"],"prefix":"10.1007","volume":"42","author":[{"given":"Alysson M.","family":"Costa","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"key":"9122_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A.: On capacitated network design cut-set polyhedra. Math. Program. 92, 425\u2013437 (2002)","journal-title":"Math. Program."},{"key":"9122_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A.: On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"9122_CR3","first-page":"311","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"A. Balakrishnan","year":"1997","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Network design. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 311\u2013334. Wiley, New York (1997)"},{"key":"9122_CR4","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 823\u2013837 (1996)","journal-title":"SIAM J. Optim."},{"key":"9122_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"9122_CR6","unstructured":"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\u00e9 de Montr\u00e9al (2003)"},{"key":"9122_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T.G. Crainic","year":"2000","unstructured":"Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12, 223\u2013236 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9122_CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"T.G. Crainic","year":"2004","unstructured":"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\u2013545 (2004)","journal-title":"J. Heuristics"},{"key":"9122_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(99)00020-6","volume":"25","author":"V. Gabrel","year":"1999","unstructured":"Gabrel, V., Knippel, A., Minoux, M.: Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25, 15\u201323 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9122_CR10","unstructured":"Gendron, B., Crainic, T.G.: Relaxations for multicommodity capacitated network design problems. Publication CRT-965, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al (1994)"},{"key":"9122_CR11","unstructured":"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\u00e9 de\u00a0Montr\u00e9al (1996)"},{"key":"9122_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-5087-7_1","volume-title":"Telecommunications Network Planning","author":"B. Gendron","year":"1999","unstructured":"Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Sanso,\u00a0B., Soriano,\u00a0P. (eds.) Telecommunications Network Planning, pp. 1\u201319. Kluwer, Norwell (1999)"},{"key":"9122_CR13","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I. Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51, 655\u2013667 (2003)","journal-title":"Oper. Res."},{"key":"9122_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I. Ghamlouche","year":"2004","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131, 109\u2013133 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9122_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17\u201339 (1999)","journal-title":"Math. Program."},{"key":"9122_CR16","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"9122_CR17","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/11561071_7","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms (ESA)","author":"G. Kliewer","year":"2005","unstructured":"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.\u00a03669, pp. 47\u201358. Springer, Berlin (2005)"},{"key":"9122_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transp. Sci. 18, 1\u201356 (1984)","journal-title":"Transp. Sci."},{"key":"9122_CR19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M.: Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313\u2013360 (1989)","journal-title":"Networks"},{"key":"9122_CR20","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/3-540-45749-6_73","volume-title":"Proceedings of the 10th Annual European Symposium on Algorithms (ESA)","author":"M. Sellman","year":"2002","unstructured":"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.\u00a02461, pp. 845\u2013858. Springer, Berlin (2002)"},{"key":"9122_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68, 149\u2013167 (1994)","journal-title":"Numer. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9122-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9122-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9122-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:33Z","timestamp":1559302593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9122-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9122"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9122-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,31]]}}}