{"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":1786144294959,"version":"3.56.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0167-6377(02)00124-4","type":"journal-article","created":{"date-parts":[[2002,10,3]],"date-time":"2002-10-03T15:36:09Z","timestamp":1033659369000},"page":"252-264","source":"Crossref","is-referenced-by-count":20,"title":["A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems"],"prefix":"10.1016","volume":"30","author":[{"given":"V.","family":"Gabrel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Minoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00124-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\/S0167-6377(02)00124-4_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0123007","article-title":"Canonical cuts on the unit hypercube","volume":"23","author":"Balas","year":"1972","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0167-6377(02)00124-4_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","article-title":"Facets of the knapsack problem from minimal covers","volume":"34","author":"Balas","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB4","series-title":"Mathematical Programming","first-page":"13","article-title":"Lifting and complementing yields all the facets of positive 0\u20131 programming polytopes","author":"Balas","year":"1984"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multidimensional knapsack problems","volume":"4","author":"Chu","year":"1998","journal-title":"J. Heuristics"},{"issue":"4","key":"10.1016\/S0167-6377(02)00124-4_BIB6","first-page":"219","article-title":"On the strength of relaxations of multidimensional knapsack problems","volume":"32","author":"Crama","year":"1994","journal-title":"INFORM"},{"issue":"5","key":"10.1016\/S0167-6377(02)00124-4_BIB7","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":"31","author":"Crowder","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(92)90085-N","article-title":"On tightening cover-induced inequalities","volume":"60","author":"Dietrich","year":"1992","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0166-218X(93)90044-O","article-title":"Efficient reformulation for 0\u20131 programs\u2014methods and computational results","volume":"42","author":"Dietrich","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1018973511339","article-title":"On tightening 0\u20131 programs based on extensions of pure 0\u20131 knapsack and subset-sum problems","volume":"81","author":"Escudero","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0377-2217(86)90042-1","article-title":"Heuristics and reduction methods for multiple constraint 0\u20131 linear programming problems","volume":"24","author":"Freville","year":"1986","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(94)90209-7","article-title":"An efficient preprocessing procedure for the multidimensional 0\u20131 knapsack problem","volume":"49","author":"Freville","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(99)00020-6","article-title":"Exact solution of multicommodity network optimization problems with general step cost functions","volume":"25","author":"Gabrel","year":"1999","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/S0167-6377(02)00124-4_BIB14","first-page":"219","article-title":"Surrogate constraints in integer programming","volume":"12","author":"Gavish","year":"1991","journal-title":"J. Inform. Optim. Sci."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","article-title":"Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality","volume":"31","author":"Gavish","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB16","series-title":"Graphs and Algorithms","author":"Gondran","year":"1995"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB17","first-page":"121","article-title":"Improving LP representations of 0\u20131 linear programs for branch and cut","volume":"3","author":"Hoffman","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/nav.3800030108","article-title":"Attrition games","volume":"3","author":"Isbell","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB19","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective functions","volume":"4","author":"Megiddo","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB21","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"Minto, a mixed integer optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB23","unstructured":"M.A. Osorio, F. Glover, P.L. Hammer, Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Unpublished Research Report, 2000."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB24","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","article-title":"(1\u2212k)-Configuration and facets for packing problems","volume":"18","author":"Padberg","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00124-4_BIB25","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","article-title":"A branch and bound method for the multiconstraint zero-one knapsack problem","volume":"30","author":"Shih","year":"1979","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/S0167-6377(02)00124-4_BIB26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programming problems using automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00124-4_BIB27","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","article-title":"Solving multiple knapsack problem by cutting planes","volume":"6","author":"Weismantel","year":"1996","journal-title":"SIAM J. Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T23:20:51Z","timestamp":1554765651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0167637702001244"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00124-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}