{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:11:34Z","timestamp":1786144294261,"version":"3.56.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0166-218x(92)90162-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"113-123","source":"Crossref","is-referenced-by-count":15,"title":["The complexity of lifted inequalities for the knapsack problem"],"prefix":"10.1016","volume":"39","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eitan","family":"Zemel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90162-4_BIB1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","article-title":"Facets of the knapsack polytope from minimal covers","volume":"34","author":"Balas","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(92)90162-4_BIB3","series-title":"Mathematical Programming","first-page":"13","article-title":"Lifting and complementing yields all the facets of positive zero-one programming polytopes","author":"Balas","year":"1984"},{"key":"10.1016\/0166-218X(92)90162-4_BIB4","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large scale zero-one linear programming problems","volume":"5","author":"Crowder","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)90162-4_BIB5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large scale symmetric traveling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(92)90162-4_BIB6","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","article-title":"Covers and packings in a family of sets","volume":"68","author":"Edmonds","year":"1962","journal-title":"Amer. Math. Soc. Bull."},{"key":"10.1016\/0166-218X(92)90162-4_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0-1 vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0166-218X(92)90162-4_BIB8","series-title":"Computers and Intractability: A Guide to Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)90162-4_BIB9","series-title":"Combinatorial Optimization\u2014Annotated Bibliographies","first-page":"1","article-title":"Polyhedral combinatorics","author":"Grotschel","year":"1985"},{"key":"10.1016\/0166-218X(92)90162-4_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Grotschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(92)90162-4_BIB11","series-title":"The Travelling Salesman Problem","first-page":"251","article-title":"Polyhedral theory","author":"Grotschel","year":"1985"},{"key":"10.1016\/0166-218X(92)90162-4_BIB12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","article-title":"Facets of regular 0\u20131 polytopes","volume":"8","author":"Hammer","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB13","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1137\/0211053","article-title":"On linear characterization of combinatorial optimization problems","volume":"2","author":"Karp","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90162-4_BIB14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"Properties of vertex packing and independence system polyhedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB15","first-page":"198","article-title":"On the facial structure of set packing polyhedra","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB16","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","article-title":"A note on zero-one programming","volume":"3","author":"Padberg","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)90162-4_BIB17","unstructured":"M.W. Padberg and M.R. Rao, The Russian method for linear inequalities III: Bounded integer programming, Math. Programming Stud., to appear."},{"key":"10.1016\/0166-218X(92)90162-4_BIB18","first-page":"74","article-title":"The complexity of facets resolves","author":"Papadimitriou","year":"1985","journal-title":"Proceedings 26th Annual Symposium on Foundations of Computer Science, Portland, OR"},{"key":"10.1016\/0166-218X(92)90162-4_BIB19","first-page":"244","article-title":"The complexity of facets (and some facets of complexity)","volume":"2","author":"Papadimitriou","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(92)90162-4_BIB20","first-page":"435","article-title":"Properties of facets of binary polytopes","volume":"1","author":"Peled","year":"1977"},{"key":"10.1016\/0166-218X(92)90162-4_BIB21","series-title":"Mathematical Programming The State of the Art","first-page":"312","article-title":"Polyhedral combinatorics","author":"Pulleyblank","year":"1983"},{"key":"10.1016\/0166-218X(92)90162-4_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532 city symmetric travelling salesman problem by branch and cut","volume":"6","author":"Rinaldi","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(92)90162-4_BIB23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces of linear inequalities in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB24","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","article-title":"Lifting the facets of 0\u20131 polytopes","volume":"15","author":"Zemel","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90162-4_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.14.4.760","article-title":"Easily computable facets of the knapsack problem","volume":"14","author":"Zemel","year":"1989","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92901624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:15Z","timestamp":1555136655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92901624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0166218X92901624"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90162-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}