{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:08Z","timestamp":1751342828190,"version":"3.41.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1024423013607","type":"journal-article","created":{"date-parts":[[2003,9,15]],"date-time":"2003-09-15T17:22:37Z","timestamp":1063646557000},"page":"161-167","source":"Crossref","is-referenced-by-count":0,"title":["Zero-Lifting for Integer Block Structured Problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Giovanni","family":"Felici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Gentile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5128226_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"G. Cornu\u00e9jols and W. Pulleyblank, \u201cA matching problem with side conditions,\u201d Discrete Mathematics, vol. 29, pp. 135\u2013159, 1980.","journal-title":"Discrete Mathematics"},{"key":"5128226_CR2","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"C.E. Ferreira","year":"1996","unstructured":"C.E. Ferreira, A. Martin, and R. Weismantel, \u201cSolving multiple knapsack problems by cutting planes,\u201d SIAM Journal on Optimization, vol. 6, pp. 858\u2013877, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"5128226_CR3","series-title":"Research Notes in Mathematics","volume-title":"Edge-Colourings of Graphs","author":"S. Fiorini","year":"1977","unstructured":"S. Fiorini and R.J. Wilson, Edge-Colourings of Graphs, vol. 16 of Research Notes in Mathematics, Pitman: London, 1977."},{"key":"5128226_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb and M.R. Rao, \u201cThe generalized assignment problem: Valid inequalities and facets,\u201d Mathematical Programming, vol. 46, pp. 31\u201352, 1990.","journal-title":"Mathematical Programming"},{"key":"5128226_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02592085","volume":"72","author":"M. Gr\u00f6tschel","year":"1996","unstructured":"M. Gr\u00f6tschel, A. Martin, and R. Weismantel, \u201cPacking steiner trees: Polyhedral investigations,\u201d Mathematical Programming, vol. 72, pp. 101\u2013124, 1996.","journal-title":"Mathematical Programming"},{"key":"5128226_CR6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Hoyler","year":"1981","unstructured":"I. Hoyler, \u201cThe NP-completeness of edge-coloring,\u201d SIAM Journal on Computing, vol. 10, pp. 718\u2013720, 1981.","journal-title":"SIAM Journal on Computing"},{"key":"5128226_CR7","first-page":"173","volume-title":"Combinatorial Programming, Methods and Applications","author":"J. Krarup","year":"1975","unstructured":"J. Krarup, \u201cThe peripatetic salesman problem and some related unsolved problems,\u201d in Combinatorial Programming, Methods and Applications, B. Roy (Ed.), Reidel: Dordrecht, The Netherlands, 1975, pp. 173\u2013178."},{"key":"5128226_CR8","unstructured":"A. Martin, \u201cInteger programs with block structure,\u201d Habilitationsshrift, Technische Universit\u00e4t Berlin, 1998."},{"key":"5128226_CR9","volume-title":"Integer and Combinatorial Programming","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Programming, Wiley: New York, 1988."},{"key":"5128226_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, \u201cOnthe facial structure of set packing polyhedra,\u201d Mathematical Programming, vol. 5, pp. 199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"5128226_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1976","unstructured":"L.A. Wolsey, \u201cFacets and strong valid inequalities for integer programs,\u201d Operations Research, vol. 24, pp. 367\u2013372, 1976.","journal-title":"Operations Research"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024423013607.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024423013607\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024423013607.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:07:04Z","timestamp":1751281624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024423013607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5128226"],"URL":"https:\/\/doi.org\/10.1023\/a:1024423013607","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}