{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:58:57Z","timestamp":1780729137565,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T00:00:00Z","timestamp":1273276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0359-5","type":"journal-article","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T01:26:09Z","timestamp":1273195569000},"page":"69-91","source":"Crossref","is-referenced-by-count":72,"title":["Separation algorithms for 0-1 knapsack polytopes"],"prefix":"10.1007","volume":"124","author":[{"given":"Konstantinos","family":"Kaparis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam N.","family":"Letchford","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,8]]},"reference":[{"key":"359_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 361\u2013372","DOI":"10.1016\/j.orl.2005.07.009"},{"key":"359_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10479-005-3442-1","volume":"139","author":"A. Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk A.: Cover and pack inequalities for (mixed) integer programming. Ann. of Oper. Res. 139, 21\u201338 (2005)","journal-title":"Ann. of Oper. Res."},{"key":"359_CR3","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. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"359_CR4","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 J. Appl. Math. 34, 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"359_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"359_CR6","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1016\/j.cor.2005.05.032","volume":"34","author":"T. Bektas","year":"2007","unstructured":"Bektas T., Oguz O.: On separating cover inequalities for the multidimensional knapsack problem. Comp. Oper. Res. 34, 1771\u20131776 (2007)","journal-title":"Comp. Oper. Res."},{"key":"359_CR7","volume-title":"Using exact knapsack separation for the single-source capacitated facility location problem","author":"M. Boccia","year":"2006","unstructured":"Boccia M.: Using exact knapsack separation for the single-source capacitated facility location problem. Working paper, Department of Engineering, University of Sannio (2006)"},{"key":"359_CR8","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/net.3230220507","volume":"22","author":"E.A. Boyd","year":"1992","unstructured":"Boyd E.A.: A pseudo-polynomial network flow formulation for exact knapsack separation. Networks 22, 503\u2013514 (1992)","journal-title":"Networks"},{"key":"359_CR9","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"E.A. Boyd","year":"1993","unstructured":"Boyd E.A.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optimization 3, 734\u2013750 (1993)","journal-title":"SIAM J. Optimization"},{"key":"359_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"E.A. Boyd","year":"1994","unstructured":"Boyd E.A.: Fenchel cutting planes for integer programs. Oper. Res. 42, 53\u201364 (1994)","journal-title":"Oper. Res."},{"key":"359_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu P.C., Beasley J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heur. 4, 63\u201386 (1998)","journal-title":"J. Heur."},{"key":"359_CR12","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms. MIT Press, Cambridge, MA (2001)"},{"key":"359_CR13","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., Padberg M.: Solving large-scale 0-1 linear programming programs. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"359_CR14","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"C.E. Ferreira","year":"1996","unstructured":"Ferreira C.E., Martin A., Weismantel R.: Solving multiple knapsack problems by cutting planes. SIAM J. Opt. 6, 858\u2013877 (1996)","journal-title":"SIAM J. Opt."},{"key":"359_CR15","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/S0167-6377(02)00124-4","volume":"30","author":"V. Gabrel","year":"2002","unstructured":"Gabrel V., Minoux M.: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Oper. Res. Lett. 30, 252\u2013264 (2002)","journal-title":"Oper. Res. Lett."},{"key":"359_CR16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Lifted cover inequalities for 0-1 integer programs: computation. INFORMS J. Computing 10, 427\u2013437 (1998)","journal-title":"INFORMS J. Computing"},{"key":"359_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/ijoc.11.1.117","volume":"11","author":"Z. Gu","year":"1999","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Lifted cover inequalities for 0-1 integer programs: complexity. INFORMS J. Computing 11, 117\u2013123 (1999)","journal-title":"INFORMS J. Computing"},{"key":"359_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Sequence independent lifting in mixed integer programming. J. Comb. Opt. 4, 109\u2013129 (2000)","journal-title":"J. Comb. Opt."},{"key":"359_CR19","doi-asserted-by":"crossref","unstructured":"Helmberg, C., Weismantel, R.: Cutting plane algorithms for semidefinite relaxations. In: Pardalos, P.M., Wolkowicz, H. (eds.) Fields Institute Communications. vol. 18, pp. 197\u2013213 (1998)","DOI":"10.1090\/fic\/018\/14"},{"key":"359_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K.L. Hoffman","year":"1991","unstructured":"Hoffman K.L., Padberg M.W.: Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3, 121\u2013134 (1991)","journal-title":"ORSA J. Comput."},{"key":"359_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ejor.2007.01.032","volume":"186","author":"K. Kaparis","year":"2008","unstructured":"Kaparis K., Letchford A.N.: Local and global lifted cover inequalities for the multidimensional knapsack problem. Eur. J. Opl Res. 186, 91\u2013103 (2008)","journal-title":"Eur. J. Opl Res."},{"key":"359_CR22","volume-title":"Complexity of Computer Computations.","author":"R.M. Karp","year":"1972","unstructured":"Karp R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations., Plenum, New York (1972)"},{"key":"359_CR23","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0167-6377(98)00025-X","volume":"23","author":"D. Klabjan","year":"1998","unstructured":"Klabjan D., Nemhauser G.L., Tovey C.: The complexity of cover inequality separation. Oper. Res. Lett. 23, 35\u201340 (1998)","journal-title":"Oper. Res. Lett."},{"key":"359_CR24","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":"359_CR25","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M.W. Padberg","year":"1980","unstructured":"Padberg M.W.: (1, k)-configurations and facets for packing problems. Math. Program. 18, 94\u201399 (1980)","journal-title":"Math. Program."},{"key":"359_CR26","first-page":"758","volume":"46","author":"D. Pisinger","year":"1995","unstructured":"Pisinger D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 46, 758\u2013767 (1995)","journal-title":"Oper. Res."},{"key":"359_CR27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.J. Van Roy","year":"1987","unstructured":"Van Roy T.J., Wolsey L.A.: Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35, 45\u201357 (1987)","journal-title":"Oper. Res."},{"key":"359_CR28","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10878-007-9074-4","volume":"15","author":"Y. Vimont","year":"2008","unstructured":"Vimont Y., Boussier S., Vasquez M.: Reduced costs propagation in an efficient implicit enumeration for the 0-1 multidimensional knapsack problem. J. Comb. Opt. 15, 165\u2013178 (2008)","journal-title":"J. Comb. Opt."},{"key":"359_CR29","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"Weismantel R.: On the 0-1 knapsack polytope. Math. Program. 77, 49\u201368 (1997)","journal-title":"Math. Program."},{"key":"359_CR30","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams J.W.J.: Algorithm 232\u2014Heapsort. Commun. ACM 7, 347\u2013348 (1964)","journal-title":"Commun. ACM"},{"key":"359_CR31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A.: Faces for a linear inequality in 0-1 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"359_CR32","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E. Zemel","year":"1989","unstructured":"Zemel E.: Easily computable facets of the knapsack polytope. Math. Oper. Res. 14, 760\u2013765 (1989)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0359-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0359-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0359-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T10:03:05Z","timestamp":1635328985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0359-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,8]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0359-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,8]]}}}