{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:45Z","timestamp":1747579545235},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":[[1987,10]]},"DOI":"10.1007\/bf02592077","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:55:37Z","timestamp":1175183737000},"page":"263-284","source":"Crossref","is-referenced-by-count":9,"title":["LP extreme points and cuts for the fixed-charge network design problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Anantaram","family":"Balakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592077_CR1","volume-title":"Valid inequalities and algorithms for the network design problem with an application to LTL consolidation","author":"A. Balakrishnan","year":"1984","unstructured":"A. Balakrishnan, \u201cValid inequalities and algorithms for the network design problem with an application to LTL consolidation,\u201d Dissertation, Sloan School of Management, Massachusetts Institute of Technology (Cambridge, MA, 1984)."},{"key":"BF02592077_CR2","series-title":"Working paper","volume-title":"A composite algorithm for the concave-cost LTL consolidation problem","author":"A. Balakrishnan","year":"1985","unstructured":"A. Balakrishnan and S.C. Graves, \u201cA composite algorithm for the concave-cost LTL consolidation problem,\u201d Working paper No. 877, Krannert Graduate School of Management, Purdue University (West Lafayette, 1985)."},{"key":"BF02592077_CR3","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/moor.8.4.579","volume":"8","author":"D.C. Cho","year":"1983","unstructured":"D.C. Cho, E.L. Johnson, M.W. Padberg and M.R. Rao, \u201cOn the uncapacitated plant location problem I: Valid inequalities and facets,\u201dMathematics of Operations Research 8 (1983a) 579\u2013589.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592077_CR4","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1287\/moor.8.4.590","volume":"8","author":"D.C. Cho","year":"1983","unstructured":"D.C. Cho, M.W. Padberg and M.R. Rao, \u201cOn the uncapacitated plant location problem II: Facets and lifting theorems,\u201dMathematics of Operations Research 8 (1983b) 590\u2013612.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592077_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chvatal","year":"1973","unstructured":"V. Chvatal, \u201cEdmonds polytopes and a hierarchy of combinatiorial problems,\u201dDiscrete Mathematics 4 (1973) 305\u2013337","journal-title":"Discrete Mathematics"},{"key":"BF02592077_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-5060(08)70732-5","volume":"1","author":"G. Cornuejols","year":"1977","unstructured":"G. Cornuejols, M. Fisher and G.L. Nemhauser, \u201cOn the uncapacitated plant location problems,\u201dAnnals of Discrete Mathematics 1 (1977) 163\u2013177.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02592077_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","volume":"23","author":"G. Cornuejols","year":"1982","unstructured":"G. Cornuejols and J.M. Thizy, \u201cSome facets of the simple plant location polytope,\u201dMathematical Programming 23 (1982) 50\u201374.","journal-title":"Mathematical Programming"},{"key":"BF02592077_CR8","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 M.W. Padberg, \u201cSolving large-scale zero-one linear programming problems,\u201dOperations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"BF02592077_CR9","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter, \u201cA dual-based procedure for uncapacitated facility location,\u201dOperations Research 26 (1978) 992\u20131009.","journal-title":"Operations Research"},{"key":"BF02592077_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"M. Grotschel and W.R. Pulleybland, \u201cWeakly bipartite graphs and the max cut problem,\u201dOperations Research Letters 1 (1981) 23\u201327.","journal-title":"Operations Research Letters"},{"key":"BF02592077_CR11","first-page":"150","volume":"12","author":"M. Guignard","year":"1980","unstructured":"M. Guignard, \u201cFractional vertices, cuts and facets of the simple plant location problem,\u201dMathematical Programming 12 (1980) 150\u2013162.","journal-title":"Mathematical Programming"},{"key":"BF02592077_CR12","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/net.3230140403","volume":"14","author":"A.S. Lapaugh","year":"1984","unstructured":"A.S. Lapaugh and C.H. Papadimitriou, \u201cThe even-path problem for graphs and digraphs,\u201dNetwork 14 (1984) 507\u2013513.","journal-title":"Network"},{"key":"BF02592077_CR13","volume-title":"Combinatioal Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatioal Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"BF02592077_CR14","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T.L. Magnanti","year":"1981","unstructured":"T.L. Magnanti and R.T. Wong, \u201cAccelerating Benders decomposition: Algorithmic enhancement and model selection criteria,\u201dOperations Research 29 (1981) 464\u2013484.","journal-title":"Operations Research"},{"key":"BF02592077_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"T.L. Magnanti and R.T. Wong, \u201cNetwok design and transporation planning: Models and algorithms,\u201dTransporation Science 18 (1984) 1\u201355.","journal-title":"Transporation Science"},{"key":"BF02592077_CR16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","volume":"26","author":"T.L. Magnanti","year":"1986","unstructured":"T.L. Magnanti, R.T. Wong and P. Mireault, \u201cTailoring Benders decomposition for uncapacitated network design,\u201dMathematical Programming Study 26 (1986) 112\u2013154.","journal-title":"Mathematical Programming Study"},{"key":"BF02592077_CR17","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":"BF02592077_CR18","series-title":"Technical report No. J-79-18","volume-title":"Tighter relaxations of fixed charge network flow problem","author":"R.L. Rardin","year":"1979","unstructured":"R.L. Rardin and U. Choe, \u201cTighter relaxations of fixed charge network flow problem,\u201d Technical report No. J-79-18, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, 1979)."},{"key":"BF02592077_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"A. Schrijver, \u201cOn cutting planes,\u201dAnnals of Discrete Mathematics 9 (1980) 291\u2013296.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02592077_CR20","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0120693","volume":"2","author":"H.P. Williams","year":"1974","unstructured":"H.P. Williams, \u201cExperiments in the formulation of integer programming problems,\u201dMathematical Programming Study 2 (1974) 180\u2013197.","journal-title":"Mathematical Programming Study"},{"key":"BF02592077_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"R.T. Wong, \u201cA dual ascent approach for Steiner tree problems on a directed graph,\u201dMathematical Programming 28 (1984) 271\u2013287.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592077.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592077\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["BF02592077"],"URL":"https:\/\/doi.org\/10.1007\/bf02592077","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}