{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:31:16Z","timestamp":1770993076975,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":[[2000,3]]},"DOI":"10.1023\/a:1009841107478","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"109-129","source":"Crossref","is-referenced-by-count":105,"title":["Sequence Independent Lifting in Mixed Integer Programming"],"prefix":"10.1007","volume":"4","author":[{"given":"Zonghao","family":"Gu","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Martin W.P.","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"254807_CR1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cFacets of the Knapsack polytope,\u201d Mathematical Programming, vol. 8, pp. 146-164, 1975.","journal-title":"Mathematical Programming"},{"key":"254807_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel, \u201cFacets of the Knapsack polytope from minimal covers,\u201d SIAM Journal on Applied Mathematics, vol. 34, pp. 119-148, 1978.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"254807_CR3","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,\u201d Operations Research, vol. 31, pp. 803-834, 1983.","journal-title":"Operations Research"},{"key":"254807_CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"R.E. Gomory, \u201cSome polyhedra related to combinatorial problems,\u201d Linear Algebra and Its Applications, vol. 2, pp. 451-558, 1969.","journal-title":"Linear Algebra and Its Applications"},{"key":"254807_CR5","unstructured":"Z. Gu, \u201cLifted cover inequalities for 0-1 and mixed integer programs,\u201d Ph.D. Thesis, Georgia Institute of Technology, 1994."},{"key":"254807_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, \u201cLifted cover inequalities for 0-1 integer programs: Computation,\u201d INFORMS Journal on Computing, vol. 10, pp. 427-437, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"254807_CR7","first-page":"439","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Lifted Flow Cover Inequalities for Mixed 0-1 Integer Programs. Report LEC-96-05, Georgia Institute of Technology, Atlanta, Mathematical Programming, vol. 85, pp. 439-468, 1999.","journal-title":"Lifted Flow Cover Inequalities for Mixed 0-1 Integer Programs"},{"key":"254807_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"H. Marchand and L.A. Wolsey, \u201cThe 0-1 knapsack problem with a single continuous variable,\u201d Mathematical Programming, vol. 85, pp. 15-33, 1999.","journal-title":"Mathematical Programming"},{"key":"254807_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. Wiley: New York, 1988."},{"key":"254807_CR10","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, vol. 5, pp. 199-215, 1973.","journal-title":"Mathematical Programming"},{"key":"254807_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, \u201cValid linear inequalities for fixed charge problems,\u201d Operations Research, vol. 33, pp. 842-861, 1985.","journal-title":"Operations Research"},{"key":"254807_CR12","unstructured":"Y. Pochet, \u201cA note on lifting single node flow cover inequalities,\u201d Unpublished manuscript, 1993."},{"key":"254807_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.J. Van Roy","year":"1986","unstructured":"T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities for mixed 0-1 programs,\u201d Discrete Applied Mathematics, vol. 14, pp. 199-213, 1986.","journal-title":"Discrete Applied Mathematics"},{"key":"254807_CR14","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-372, 1976.","journal-title":"Operations Research"},{"key":"254807_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"L.A. Wolsey, \u201cValid inequalities and superadditivity for 0-1 integer programs,\u201d Mathematics of Operations Research, vol. 2, pp. 66-77, 1977.","journal-title":"Mathematics of Operations Research"},{"key":"254807_CR16","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-one polytopes,\u201d Mathematical Programming, vol. 15, pp. 268-277, 1978.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009841107478.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009841107478\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009841107478.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:14Z","timestamp":1751282054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009841107478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["254807"],"URL":"https:\/\/doi.org\/10.1023\/a:1009841107478","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}