{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:12Z","timestamp":1725562632072},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_2","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"16-32","source":"Crossref","is-referenced-by-count":2,"title":["Metric Inequalities and the Network Loading Problem"],"prefix":"10.1007","author":[{"given":"Pasquale","family":"Avella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Mattia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamturk","year":"2002","unstructured":"Atamturk, A.: On Capacitated Network Design Cut-Set Polyhedra. Math. Progr.\u00a092, 425\u2013437 (2002)","journal-title":"Math. Progr."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamturk","year":"2002","unstructured":"Atamturk, A., Rajan, D.: On Splittable and Unsplittable Capacitated Network Design Arc-Set Polyhedra. Math. Progr.\u00a092, 315\u2013333 (2002)","journal-title":"Math. Progr."},{"key":"2_CR3","series-title":"ch. 18","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. ch. 18, Wiley, Chichester (1997)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6-3","author":"F. Barahona","year":"1996","unstructured":"Barahona, F.: Network Design Using Cut Inequalities. SIAM J. Optimization\u00a06-3, 823\u2013837 (1996)","journal-title":"SIAM J. Optimization"},{"key":"2_CR5","unstructured":"Berger, D., Gendron, B., Potvin, J.Y., Raghavan, S., Soriano, P.: Tabu Search for a Network Loading Problem with Multiple Facilities. J. of Heuristics (1999) (to appear)"},{"key":"2_CR6","unstructured":"Bienstock, D.: Experiments with a Network Design Algorithm using -approximate Linear Programs (1996) (manuscript )"},{"key":"2_CR7","unstructured":"Bienstock, D.: Approximately solving large-scale linear programs. I: Strengthening lower bounds and accelerating convergence, CORC Report 1999-1, Columbia University (1999)"},{"key":"2_CR8","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice. Kluwer, Boston (2002)"},{"key":"2_CR9","unstructured":"Bienstock, D., Bley, A.: Capacitated Network Design with Mulicast Commodities. In: Proc. of 8th International Conference on Telecommunication Systems, Nashville, March 9-12 (2000)"},{"key":"2_CR10","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.: Minimum Cost Capacity Installation for Multicommodity Network Flows. Math. Progr.\u00a081, 177\u2013199 (1998)","journal-title":"Math. Progr."},{"key":"2_CR11","first-page":"213","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem. Math. Progr.\u00a068, 213\u2013237 (1995)","journal-title":"Math. Progr."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated Network Design\u2013Polyhedral Structure, and Computation. INFORMS Journal On Computing\u00a08(3), 243\u2013259 (1996)","journal-title":"INFORMS Journal On Computing"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s101070100254","volume":"91","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D., Raskina, O.: Asymptotic Analysis of the Flow Deviation Method for the Maximum Concurrent Flow Problem. Math. Progr.\u00a091, 379\u2013392 (2002)","journal-title":"Math. Progr."},{"key":"2_CR14","first-page":"221","volume":"74","author":"M. Caprara","year":"1996","unstructured":"Caprara, M.: Fischetti: {0, 1 2 }-Chv\u00e1tal-Gomory Cuts. Math. Progr.\u00a074, 221\u2013235 (1996)","journal-title":"Math. Progr."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s101079900107","volume":"87-1","author":"M. Caprara","year":"2000","unstructured":"Caprara, M., Fischetti, A.N.: Letchford: On the Separation of Maximally Violated mod-k Cuts. Math. Progr.\u00a087-1, 37\u201356 (2000)","journal-title":"Math. Progr."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(98)00024-9","volume":"85","author":"S. Chopra","year":"1998","unstructured":"Chopra, S., Gilboa, I., Sastry, S.T.: Source Sink Flows with Capacity Installation in Batches. Disc. Appl. Math.\u00a085, 165\u2013192 (1998)","journal-title":"Disc. Appl. Math."},{"key":"2_CR17","volume-title":"Telecommunications Network Planning","author":"T.G. Crainic","year":"1998","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Multicommodity Capacitated Network Design. In: Sans\u00f3, B., Soriano, P. (eds.) Telecommunications Network Planning, Kluwer Academic, Dordrecht (1998)"},{"key":"2_CR18","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems. Discrete Applied Mathematics (1998) (to appear)"},{"key":"2_CR19","unstructured":"Crainic, T.G., Gendreau, M.: Cooperative Parallel Tabu Search for Capacitated Network Design, Centre de recherche sur les transports, Report CRT-98-71, Universit\u00e9 de Montr\u00e8al (1998)"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","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.: Simplex-Based Tabu Search for the Multicommodity Capacitated Fixed Charge Network Design Problem. INFORMS Journal on Computing\u00a012(3), 223\u2013236 (2000)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G. Dahl","year":"1998","unstructured":"Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing\u00a010(1), 1\u201311 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M. Deza","year":"1997","unstructured":"Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the Membership Problem for the Elementary Closure of a Polyhedron. Combinatorica\u00a019, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L. Fleischer","year":"2000","unstructured":"Fleischer, L.: Approximating Fractional Multicommodity Flows Independent of the Number of Commodities. SIAM Journal Discrete Mathematics\u00a013(4), 505\u2013520 (2000)","journal-title":"SIAM Journal Discrete Mathematics"},{"key":"2_CR25","doi-asserted-by":"publisher","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. Progr.\u00a086, 17\u201339 (1999)","journal-title":"Math. Progr."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-47867-1_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"O. G\u00fcnl\u00fck","year":"2002","unstructured":"G\u00fcnl\u00fck, O.: A new min-cut max-flow ratio for multicommodity flow problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, p. 54. Springer, Heidelberg (2002)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48-3","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Operations Research\u00a048-3, 461\u2013481 (2000)","journal-title":"Operations Research"},{"key":"2_CR28","first-page":"129","volume":"13","author":"M. Iri","year":"1971","unstructured":"Iri, M.: On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan\u00a013, 129\u2013135 (1971)","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(02)00111-6","volume":"30","author":"A.N. Letchford","year":"2002","unstructured":"Letchford, A.N.: Totally Tight Chv\u00e1tal-Gomory Cuts. Operations Research Letters\u00a030(2), 71\u201373 (2002)","journal-title":"Operations Research Letters"},{"key":"2_CR30","unstructured":"Lomonosov, M.: Feasibility conditions for multiflow problems. Discrete Mathematics (1982)"},{"key":"2_CR31","unstructured":"Lomonosov, M., Sebo, A.: On the geodesic structure of graphs: a polyhedral approach to metric decomposition. In: Proceedings of IPCO, pp. 221\u2013234 (1993)"},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Core Capacitated Network Loading Problem. Operations Research\u00a043(1), 142\u2013157 (1995)","journal-title":"Operations Research"},{"issue":"1","key":"2_CR33","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Two- Facility Capacitated Network Loading Problem. Operations Research\u00a043(1), 142\u2013157 (1995)","journal-title":"Operations Research"},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"CT-18","author":"K. Onaga","year":"1971","unstructured":"Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in networks. Transactions on Circuit Theory\u00a0CT-18(4), 425\u2013429 (1971)","journal-title":"Transactions on Circuit Theory"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"Stoer, M., Dahl, G.: A polyhedral approach to multicommodity network design. Numerische Mathematik\u00a068, 149\u2013167 (1994)","journal-title":"Numerische Mathematik"},{"key":"2_CR36","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"2002","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, Chichester (2002)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:19:42Z","timestamp":1620011982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}