{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:33Z","timestamp":1725488433456},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_19","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"243-256","source":"Crossref","is-referenced-by-count":6,"title":["The Intersection of Knapsack Polyhedra and Extensions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria, and G. Cornu\u00e9jols. A lift-and-project cutting plane algorithm for mixed 0 \u2212 1 programs. Mathematical Programming, 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"19_CR2","unstructured":"R. E. Bixby, S. Ceria, C. M. McZeal, and M. W. P. Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0. 1998. Paper and problems available at \n                    http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html"},{"key":"19_CR3","series-title":"Technical Report","volume-title":"Cutting planes for integer programs with general integer variables","author":"S. Ceria","year":"1997","unstructured":"S. Ceria, C. Cordier, H. Marchand, and L. A. Wolsey. Cutting planes for integer programs with general integer variables. Technical Report CORE DP9575, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1997."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305\u2013337, 1973.","journal-title":"Discrete Mathematics"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E. Johnson, and M. W. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31:803\u2013834, 1983.","journal-title":"Operations Research"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"R. E. Gomory. Solving linear programming problems in integers. In R. Bellman and M. Hall, editors, Combinatorial analysis, Proceedings of Symposia in Applied Mathematics, Vol. 10. Providence, RI, 1960.","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"19_CR7","series-title":"Technical Report","volume-title":"The 0\u22121 knapsack problem with a single continuous variable","author":"H. Marchand","year":"1997","unstructured":"H. Marchand and L. A. Wolsey. The 0\u22121 knapsack problem with a single continuous variable. Technical Report CORE DP9720, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1997."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M. W. Padberg","year":"1975","unstructured":"M. W. Padberg. A note on zero-one programming. Operations Research, 23:833\u2013837, 1975.","journal-title":"Operations Research"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M. W. Padberg","year":"1980","unstructured":"M. W. Padberg. (1,k)-configurations and facets for packing problems. Mathematical Programming, 18:94\u201399, 1980.","journal-title":"Mathematical Programming"},{"key":"19_CR11","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. Valid inequalities for fixed charge problems. Operations Research, 33:842\u2013861, 1985.","journal-title":"Operations Research"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"A. Schrijver. On cutting planes. Annals of Discrete Mathematics, 9:291\u2013296, 1980.","journal-title":"Annals of Discrete Mathematics"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L. A. Wolsey","year":"1975","unstructured":"L. A. Wolsey. Faces of linear inequalities in 0\u22121 variables. Mathematical Programming, 8:165\u2013178, 1975.","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T22:10:52Z","timestamp":1550441452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}