{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:27:50Z","timestamp":1772497670939,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":[[1989,5]]},"DOI":"10.1007\/bf01587093","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:28Z","timestamp":1114679368000},"page":"271-291","source":"Crossref","is-referenced-by-count":62,"title":["Valid inequalities and facets of the capacitated plant location problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Janny M. Y.","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M.W. Padberg, \u201cSet partitioning: A survey,\u201dSiam Review 18 (1976) 710\u2013760.","journal-title":"Siam Review"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, \u201cMulti-item capacitated lot sizing problems,\u201dManagement Science 30 (1984) 1255\u20131261.","journal-title":"Management Science"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1287\/mnsc.27.10.1120","volume":"27","author":"G. Bitran","year":"1981","unstructured":"G. Bitran, V. Chandru, D. Sempolinski and J. Shapiro, \u201cInverse optimization: An application to the capacitated plant location problem,\u201dManagement Science 27 (1981) 1120\u20131141.","journal-title":"Management Science"},{"key":"CR4","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,\u201dMathematics of Operations Research 8 (1983a) 579\u2013589.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","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, E.L. Johnson, 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":"CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(83)90179-0","volume":"12","author":"N. Christofides","year":"1983","unstructured":"N. Christofides and J.E. Beasley, \u201cExtensions to a Lagrangian relaxation approach for the capacitated warehouse location problem,\u201dEuropean Journal of Operational Research 12 (1983) 19\u201328.","journal-title":"European Journal of Operational Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornuejols","year":"1977","unstructured":"G. Cornuejols, M.L. Fisher and G.L. Nemhauser, \u201cLocation of bank accounts to optimize float: An analytic study of exact and approximate algorithms,\u201dManagement Science 23 (1977a) 789\u2013810.","journal-title":"Management Science"},{"key":"CR8","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.L. Fisher and G.L. Nemhauser, \u201cOn the uncapacitated location problem,\u201dAnnals of Discrete Mathematics 1 (1977b) 163\u2013177.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR9","volume-title":"\u201cThe uncapacitated facility location problem,\u201d MSRR-493","author":"G. Cornuejols","year":"1983","unstructured":"G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, \u201cThe uncapacitated facility location problem,\u201d MSRR-493, GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1983)."},{"key":"CR10","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":"CR11","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\u2013one linear programming problems,\u201dOperations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"H. Crowder and M.W. Padberg, \u201cSolving large scale symmetric travelling salesman problems to optimality,\u201dManagement Science 26 (1980) 495\u2013509.","journal-title":"Management Science"},{"key":"CR13","first-page":"394","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, \u201cSolution of a large-scale travelling salesman problem,\u201dOperations Research 2 (1954) 394\u2013410.","journal-title":"Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1080\/05695557708975155","volume":"9","author":"D.P. Dykstra","year":"1977","unstructured":"D.P. Dykstra and J.L. Riggs, \u201cAn application of facilities location theory to the design of forest harvesting areas,\u201dAIIE Transactions 9 (1977) 270\u2013277.","journal-title":"AIIE Transactions"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"G.D. Eppen","year":"1987","unstructured":"G.D. Eppen and R.K. Martin, \u201cSolving multi-item capacitated lot sizing problems using variable redefinition,\u201dOperations Research 35 (1987) 832\u2013848.","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322217.322226","volume":"27","author":"M.L. Fisher","year":"1980","unstructured":"M.L. Fisher and D.S. Hochbaum, \u201cDatabase location in computer networks,\u201dJournal of the ACM 27 (1980) 718\u2013735.","journal-title":"Journal of the ACM"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A.M. Geoffrion","year":"1978","unstructured":"A.M. Geoffrion and R. McBride, \u201cLagrangian relaxation applied to capacitated facility location problems,\u201dAIIE Transactions 10 (1978) 40\u201348.","journal-title":"AIIE Transactions"},{"key":"CR18","first-page":"1","volume-title":"Combinatorial Optimization: Annotated Bibliographies","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, \u201cPolyhedral combinatorics,\u201d in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (Wiley, New York, 1985) pp. 1\u201310."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cA cutting plane algorithm for the linear ordering problem,\u201dOperations Research 32 (1984) 1195\u20131220.","journal-title":"Operations Research"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"M Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cFacets for the linear ordering problem,\u201dMathematical Programming 33 (1985) 43\u201360.","journal-title":"Mathematical Programming"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe consequences of the ellipsoid method for combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013198.","journal-title":"Combinatorica"},{"key":"CR22","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":"CR23","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01588244","volume":"17","author":"M. Guignard","year":"1979","unstructured":"M. Guignard and K. Spielberg, \u201cA direct dual method for the mixed plant location problem with some side constraints,\u201dMathematical Programming 17 (1979) 198\u2013228.","journal-title":"Mathematical Programming"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0377-2217(83)90195-9","volume":"12","author":"S.K. Jacobsen","year":"1983","unstructured":"S.K. Jacobsen, \u201cHeuristics for the capacitated plant location problem,\u201dEuropean Journal of Operational Research 12 (1983) 253\u2013261.","journal-title":"European Journal of Operational Research"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.33.4.803","volume":"33","author":"E.L. Johnson","year":"1985","unstructured":"E.L. Johnson, M.M. Kostreva and U.H. Suhl, \u201cSolving 0\u20131 integer programming problems arising from large scale planning models,\u201dOperations Research 33 (1985) 803\u2013820.","journal-title":"Operations Research"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J. Krarup","year":"1983","unstructured":"J. Krarup and P.M. Pruzan, \u201cThe simple plant location problem: Survey and synthesis,\u201dEuropean Journal of Operational Research 12 (1983) 36\u201381.","journal-title":"European Journal of Operational Research"},{"key":"CR27","volume-title":"\u201cCutting planes based on bin packing solutions for the capacitated vehicle routing problem,\u201d G-86-10","author":"G. Laporte","year":"1986","unstructured":"G. Laporte, H. Mercure and Y. Nobert, \u201cCutting planes based on bin packing solutions for the capacitated vehicle routing problem,\u201d G-86-10, \u00c9cole des Hautes \u00c9tudes Commerciales (Montreal, Canada, 1986)."},{"key":"CR28","volume-title":"Polyhedral structure of capacitated fixed charge problems and a problem in delivery route planning","author":"J.M.Y. Leung","year":"1985","unstructured":"J.M.Y. Leung, \u201cPolyhedral structure of capacitated fixed charge problems and a problem in delivery route planning,\u201d Ph.D. thesis, Operations Research Center, MIT (Cambridge, MA, 1985)."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01589110","volume":"45","author":"J.M.Y. Leung","year":"1989","unstructured":"J.M.Y. Leung, T.L. Magnanti and R. Vachani, \u201cFacets and algorithms for capacitated lot sizing,\u201dMathematical Programming 45 (1989) 331\u2013359.","journal-title":"Mathematical Programming"},{"key":"CR30","volume-title":"Discrete Location Theory","author":"T.L. Magnanti","year":"1989","unstructured":"T.L. Magnanti and R.T. Wong, \u201cDecomposition methods for facility location problems,\u201d in: R.L. Francis and P. Mirchandani, eds.,Discrete Location Theory (Wiley, New York, 1989)."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/opre.33.3.505","volume":"33","author":"K. Martin","year":"1985","unstructured":"K. Martin and L. Schrage, \u201cSubset coefficient reduction cuts for 0\/1 mixed integer programming,\u201dOperations Research 33 (1985) 505\u2013526.","journal-title":"Operations Research"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G.L. Nemhauser","year":"1974","unstructured":"G.L. Nemhauser and L.E. Trotter, \u201cProperties of vertex packing and independence system polyhedra,\u201dMathematical Programming 6 (1974) 48\u201361.","journal-title":"Mathematical Programming"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, \u201cOn the facial structure of set packing problems,\u201dMathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","volume":"12","author":"M.W. Padberg","year":"1980","unstructured":"M.W. Padberg and S. Hong, \u201cOn the symmetric travelling salesman problem: A computational study,\u201dMathematical Programming Study 12 (1980) 78\u2013107.","journal-title":"Mathematical Programming Study"},{"key":"CR35","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 linear inequalities for fixed charge problems,\u201dOperations Research 33 (1985) 842\u2013861.","journal-title":"Operations Research"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/mnsc.24.3.345","volume":"24","author":"G.T. Ross","year":"1977","unstructured":"G.T. Ross and R.M. Soland, \u201cModelling facility location problems as generalized assignment problems,\u201dManagement Science 24 (1977) 345\u2013357.","journal-title":"Management Science"},{"key":"CR37","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1981","unstructured":"A.S. Tanenbaum,Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"CR38","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L.E. Trotter Jr.","year":"1975","unstructured":"L.E. Trotter, Jr., \u201cA class of facet producing graphs for vertex packing polyhedra,\u201dDiscrete Mathematics 12 (1975) 373\u2013388.","journal-title":"Discrete Mathematics"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"T.J. Roy Van","year":"1986","unstructured":"T.J. Van Roy, \u201cA cross decomposition algorithm for capacitated facility location,\u201dOperations Research 34 (1986) 145\u2013163.","journal-title":"Operations Research"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1287\/mnsc.28.10.1091","volume":"28","author":"T.J. Roy Van","year":"1982","unstructured":"T.J. Van Roy and D. Erlenkotter, \u201cA dual-based procedure for dynamic facility location,\u201dManagement Science 28 (1982) 1091\u20131105.","journal-title":"Management Science"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(85)90012-4","volume":"4","author":"T.J. Roy Van","year":"1985","unstructured":"T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities and separation for uncapacitated fixed charge networks,\u201dOperations Research Letters 4 (1985) 105\u2013112.","journal-title":"Operations Research Letters"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.J. Roy Van","year":"1986","unstructured":"T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities for mixed zero\u2013one programs,\u201dDiscrete Applied Mathematics 14 (1986) 199\u2013213.","journal-title":"Discrete Applied Mathematics"},{"key":"CR43","first-page":"127","volume-title":"Combinatorial Optimization: Annotated Bibliographies","author":"R.T. Wong","year":"1985","unstructured":"R.T. Wong, \u201cLocation and network design,\u201d in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (Wiley, New York, 1985) pp. 127\u2013147."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587093\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:37Z","timestamp":1556897497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":43,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587093"],"URL":"https:\/\/doi.org\/10.1007\/bf01587093","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}