{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:24:15Z","timestamp":1768011855988,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01580612","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:43:41Z","timestamp":1114667021000},"page":"233-250","source":"Crossref","is-referenced-by-count":106,"title":["The convex hull of two core capacitated network design problems"],"prefix":"10.1007","volume":"60","author":[{"given":"Thomas L.","family":"Magnanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Mirchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Vachani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W.R. Pulleyblank, \u201cThe perfectly matchable subgraph polytope of a bipartite graph,\u201dNetworks 13 (1983) 486\u2013516.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"E. Balas and W.R. Pulleyblank, \u201cThe perfectly matchable subgraph polytope of an arbitrary graph,\u201dCombinatorica 9 (1989) 321\u2013337.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, \u201cUncapacitated lot sizing: The convex hull of solutions,\u201dMathematical Programming Study 22 (1984) 32\u201343.","journal-title":"Mathematical Programming Study"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson and P.W. Padberg, \u201cSolving large-scale zero\u2013one linear programming problems,\u201dOperations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G. Cornuejols","year":"1991","unstructured":"G. Cornuejols, R. Sridharan and J.M. Thizy, \u201cA comparison of heuristics and relaxations for the capacitated plant location problem,\u201dEuropean Journal of Operations Research 50 (1991) 280\u2013297.","journal-title":"European Journal of Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0\u20131 vertices,\u201dJournal of Research of the National Bureau of Standards 69B (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR7","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids and certain polyhedra,\u201d in: R. Guy et al., eds.,Combinatorial Structures and their Applications (Gordon and Breach, London, 1970) pp. 69\u201387."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm,\u201dMathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, \u201cLagrangian relaxation for integer programming,\u201dMathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.24.4.245","volume":"24","author":"J.M.Y. Leung","year":"1990","unstructured":"J.M.Y. Leung, T.L. Magnanti and V. Singhal, \u201cRouting in point to point delivery ststems,\u201dTransportation Science 24 (1990) 245\u2013260.","journal-title":"Transportation Science"},{"key":"CR11","series-title":"Working Paper","volume-title":"Modeling and solving the capacitated network loading problem","author":"T.L. Magnanti","year":"1991","unstructured":"T.L. Magnanti, P. Mirchandani and R. Vachani, \u201cModeling and solving the capacitated network loading problem,\u201d Working Paper No. 709, Katz Graduate School of Business, University of Pittsburgh (Pittsburgh, PA, 1991)."},{"key":"CR12","volume-title":"Polyhedral structure of the capacitated network design problem with an application to the telecommunication industry","author":"P. Mirchandani","year":"1989","unstructured":"P. Mirchandani, \u201cPolyhedral structure of the capacitated network design problem with an application to the telecommunication industry,\u201d Unpublished Ph.D. dissertation, MIT, (Cambridge, MA, 1989)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg, T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities for fixed charge problems,\u201dOperations Research 33 (1985) 842\u2013861.","journal-title":"Operations Research"},{"key":"CR14","first-page":"230","volume-title":"Studies in Discrete Optimization","author":"B.A. Papernov","year":"1976","unstructured":"B.A. Papernov, \u201cFeasibility of multicommodity flows,\u201d in: A. Friedman, ed.,Studies in Discrete Optimization, (Idzat. \u201cNauka\u201d, Moscow, 1976) pp. 230\u2013261. [In Russian.]"},{"key":"CR15","first-page":"471","volume":"17A","author":"W.B. Powell","year":"1983","unstructured":"W.B. Powell and Y. Sheffi, \u201cThe load planning problem of LTL motor carriers: Problem description and a proposed solution approach,\u201dTransportation Research 17A (1983) 471\u2013480.","journal-title":"Transportation Research"},{"key":"CR16","volume-title":"\u201cDesign of private communication networks,\u201d TM 0027-07-88-446","author":"R. Vachani","year":"1988","unstructured":"R. Vachani, \u201cDesign of private communication networks,\u201d TM 0027-07-88-446, GTE Laboratories Incorporated (Waltham, MA, 1988)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580612.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580612\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:09Z","timestamp":1556881929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01580612"],"URL":"https:\/\/doi.org\/10.1007\/bf01580612","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}