{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:37Z","timestamp":1759847677902},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01583779","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:31:20Z","timestamp":1114662680000},"page":"50-74","source":"Crossref","is-referenced-by-count":60,"title":["Some facets of the simple plant location polytope"],"prefix":"10.1007","volume":"23","author":[{"given":"G.","family":"Cornuejols","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -M.","family":"Thizy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"E. Balas and N. Christofides, \u201cA restricted Lagrangean approach to the travelling salesman problem\u201d, Management Sciences Research Report 439, Carnegie-Mellon University (1979)."},{"key":"CR2","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\u201d,SIAM Review 18 (1976) 710\u2013760.","journal-title":"SIAM Review"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2.1.15","volume":"2","author":"E. Balas","year":"1977","unstructured":"E. Balas and E. Zemel, \u201cCritical cutsets of graphs and canonical facets of set-packing polytopes\u201d,Mathematics of Operations Research 2 (1977) 15\u201320.","journal-title":"Mathematics of Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","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\u201d,Mathematics of Operations Research, to appear.","DOI":"10.1287\/moor.8.4.579"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"D.C. Cho, M.W. Padberg and M.R. Rao, \u201cOn the uncapacitated plant location problem II: Facets and Lifting theorems\u201d,Mathematics of Operations Research, to appear.","DOI":"10.1287\/moor.8.4.590"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chvatal","year":"1975","unstructured":"V. Chvatal, \u201cOn certain polytopes associated with graphs\u201d,Journal of Combinatorial Theory B 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR7","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\u201d,Annals of Discrete Mathematics 1 (1977) 163\u2013177.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR8","volume-title":"Bonn workshop on combinatorial optimization, North-Holland Mathematics Studies, Vol. 66 (Annals of Discrete Mathematics 11)","author":"G. Cornuejols","year":"1982","unstructured":"G. Cornuejols and W.R. Pulleyblank, \u201cThe travelling salesman polytope and {0, 2}-matchings\u201d, in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Bonn workshop on combinatorial optimization, North-Holland Mathematics Studies, Vol. 66 (Annals of Discrete Mathematics 11) (North-Holland, Amsterdam, 1982) to appear."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, trees and flowers\u201d,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d,Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0120893","volume":"12","author":"M Guignard","year":"1980","unstructured":"M: Guignard, \u201cFractional vertices, cuts and facets of the simple plant location problem\u201d,Mathematical Programming Study 12 (1980) 150\u2013162.","journal-title":"Mathematical Programming Study"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M.W. Padberg, \u201cOn the symmetric travelling salesman problem I: Inequalities\u201d,Mathematical Programming 16 (1979) 265\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR13","volume-title":"Selected families of location problems, Part III","author":"J. Krarup","year":"1977","unstructured":"J. Krarup and P.M. Pruzan, \u201cSelected families of location problems, Part III\u201d, Institute of Datalogy, University of Copenhagen, Copenhagen (August 1977) revised version to appear."},{"key":"CR14","volume-title":"Polytopes \u00e0 sommets dans {0, 1} n","author":"J.F. Maurras","year":"1976","unstructured":"J.F. Maurras, \u201cPolytopes \u00e0 sommets dans {0, 1} n \u201d, Th\u00e8se d'\u00e9tat, University of Paris VI, Paris (1976)."},{"key":"CR15","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\u201d,Mathematical Programming 6 (1974) 48\u201361.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and L.E. Trotter, \u201cVertex packings: Structural properties and algorithms\u201d,Mathematical Programming 8 (1975) 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"CR17","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 polyhedra\u201d,Mathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0167-5060(08)70750-7","volume":"1","author":"M.W. Padberg","year":"1977","unstructured":"M.W. Padberg, \u201cOn the complexity of set packing polyhedra\u201d,Annals of Discrete Mathematics 1 (1977) 421\u2013434.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR19","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\u201d,Mathematical Programming Study 12 (1980) 78\u2013107.","journal-title":"Mathematical Programming Study"},{"key":"CR20","volume-title":"Faces of matching polyhedra","author":"W.R. Pulleyblank","year":"1973","unstructured":"W.R. Pulleyblank, \u201cFaces of matching polyhedra\u201d, Ph.D. thesis, University of Waterloo, Waterloo (1973)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L.E. Trotter","year":"1975","unstructured":"L.E. Trotter, \u201cA class of facet producing graphs for vertex packing polyhedra\u201d,Discrete Mathematics 12 (1975) 373\u2013388.","journal-title":"Discrete Mathematics"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF01580383","volume":"11","author":"L.A. Wolsey","year":"1976","unstructured":"L.A. Wolsey, \u201cFurther facet generating procedures for vertex packing polytopes\u201d,Mathematical Programming 11 (1976) 158\u2013163.","journal-title":"Mathematical Programming"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"E. Zemel, \u201cLifting the facets of zero\u2013one polytopes\u201d,Mathematical Programming 15 (1978) 268\u2013277.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01583779\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:29:24Z","timestamp":1556882964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01583779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01583779"],"URL":"https:\/\/doi.org\/10.1007\/bf01583779","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}