{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:14Z","timestamp":1747548374663},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:16:28Z","timestamp":1330276588000},"page":"452-461","source":"Crossref","is-referenced-by-count":2,"title":["Sequence independent lifting of cover inequalities"],"prefix":"10.1007","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","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the Knapsack Polytope. Mathematical Programming 8 (1975) 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E., Zemel, E.: Facets of the Knapsack Polytope from Minimal Covers. SIAM Journal on Applied Mathematics 34 (1978) 119\u2013148.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.W.: Solving Large Scale Zero-One Linear Programming Problems. Operations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"36_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":"Gomory, R.E.: Some Polyhedra Related to Combinatorial Problems. Linear Algebra and Its Applications 2 (1969) 451\u2013558.","journal-title":"Linear Algebra and Its Applications"},{"key":"36_CR5","volume-title":"Report LEC-94-09","author":"Z. Gu","year":"1994","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted Cover Inequalities for 0\u20131 Integer Programs I: Computation. Report LEC-94-09, Georgia Institute of Technology, Atlanta (1994)."},{"key":"36_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)."},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W.: On the Facial Structure of Set Packing Polyhedra. Mathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid Linear Inequalities for Fixed Charge Problems. Operations Research 33 (1985) 842\u2013861.","journal-title":"Operations Research"},{"key":"36_CR9","unstructured":"Pochet, Y.: A Note on Lifting Single Node Flow Cover Inequalities. Unpublished manuscript (1993)."},{"key":"36_CR10","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":"Van Roy, T.J., Wolsey, L.A.: Valid Inequalities for Mixed 0\u20131 Programs. Discrete Applied Mathematics 14 (1986) 199\u2013213.","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1976","unstructured":"Wolsey, L.A.: Facets and Strong Valid Inequalities for Integer Programs. Operations Research 24 (1976) 367\u2013372.","journal-title":"Operations Research"},{"key":"36_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey, L.A.: Valid Inequalities and Superadditivity for 0\u20131 Integer Programs. Mathematics of Operations Research 2 (1977) 66\u201377.","journal-title":"Mathematics of Operations Research"},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"Zemel, E.: Lifting the Facets of Zero-One Polytopes. Mathematical Programming 15 (1978) 268\u2013277.","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-59408-6_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:30:49Z","timestamp":1713630649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}