{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:06:04Z","timestamp":1777003564414,"version":"3.51.4"},"reference-count":142,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T00:00:00Z","timestamp":1568851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T00:00:00Z","timestamp":1568851200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DFG","award":["SFB 805"],"award-info":[{"award-number":["SFB 805"]}]},{"name":"DFG","award":["TRR 154"],"award-info":[{"award-number":["TRR 154"]}]},{"name":"DFG","award":["SPP 1798"],"award-info":[{"award-number":["SPP 1798"]}]},{"name":"DFG","award":["EXPRESS"],"award-info":[{"award-number":["EXPRESS"]}]},{"name":"DFG","award":["SFB 805"],"award-info":[{"award-number":["SFB 805"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10479-019-03380-2","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T17:04:01Z","timestamp":1568912641000},"page":"469-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Knapsack polytopes: a survey"],"prefix":"10.1007","volume":"292","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2990-3273","authenticated-orcid":false,"given":"Tristan","family":"Gally","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Habeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"L\u00fcthen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederic","family":"Matter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,19]]},"reference":[{"key":"3380_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of combinatorial optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., & Wunderling, R. (2013). Mixed integer programming: Analyzing 12 years of progress. In M. J\u00fcnger & G. Reinelt (Eds.), Facets of combinatorial optimization (pp. 449\u2013481). Berlin: Springer."},{"key":"3380_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-0348-8438-9_5","volume-title":"Polytopes\u2014Combinatorics and computation","author":"O Aichholzer","year":"2000","unstructured":"Aichholzer, O. (2000). Extremal properties of 0\/1-polytopes of dimension 5. In G. Ziegler & G. Kalai (Eds.), Polytopes\u2014Combinatorics and computation (pp. 111\u2013130). Basel: Birkh\u00e4user."},{"key":"3380_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0167-6377(93)90026-D","volume":"14","author":"L Amado","year":"1993","unstructured":"Amado, L., & Barcia, P. (1993). Matroidal relaxations for 0\u20131 knapsack problems. Operations Research Letters, 14, 147\u2013152.","journal-title":"Operations Research Letters"},{"key":"3380_CR4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10107-003-0390-x","volume":"96","author":"J Ar\u00e1oz","year":"2003","unstructured":"Ar\u00e1oz, J., Evans, L., Gomory, R. E., & Johnson, E. L. (2003). Cyclic group and knapsack facets. Mathematical Programming, 96, 377\u2013408.","journal-title":"Mathematical Programming"},{"key":"3380_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A. (2003). On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming, 98, 145\u2013175.","journal-title":"Mathematical Programming"},{"key":"3380_CR6","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. (2005). Cover and pack inequalities for (mixed) integer programming. Annals of Operations Research, 139, 21\u201338.","journal-title":"Annals of Operations Research"},{"key":"3380_CR7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2010","unstructured":"Avella, P., Boccia, M., & Vasilyev, I. L. (2010). A computational study of exact knapsack separation for the generalized assignment problem. Computational Optimization and Applications, 45, 543\u2013555.","journal-title":"Computational Optimization and Applications"},{"key":"3380_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.1100.0441","volume":"24","author":"P Avella","year":"2013","unstructured":"Avella, P., Boccia, M., & Vasilyev, I. L. (2013). Computational testing of a separation procedure for the knapsack set with a single continuous variable. INFORMS Journal on Computing, 24, 165\u2013171.","journal-title":"INFORMS Journal on Computing"},{"key":"3380_CR9","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10107-017-1147-2","volume":"169","author":"J Bader","year":"2018","unstructured":"Bader, J., Hildebrand, R., Weismantel, R., & Zenklusen, R. (2018). Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Mathematical Programming, 169, 565\u2013584.","journal-title":"Mathematical Programming"},{"key":"3380_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E. (1975). Facets of the knapsack polytope. Mathematical Programming, 8, 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"3380_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E Balas","year":"1989","unstructured":"Balas, E., & Ng, S. M. (1989). On the set covering polytope. I. All the facets with coefficients in $$\\{0,1,2\\}$$. Mathematical Programming, 43, 57\u201369.","journal-title":"Mathematical Programming"},{"key":"3380_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E Balas","year":"1978","unstructured":"Balas, E., & Zemel, E. (1978). Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics, 34, 119\u2013148.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"3380_CR13","first-page":"13","volume-title":"Mathematical programming: Proceedings of the international congress on mathematical programming, Rio de Janeiro, Brazil, 1981","author":"E Balas","year":"1984","unstructured":"Balas, E., & Zemel, E. (1984). Lifting and complementing yields all the facets of positive zero\u2013one programming polytopes. In R. Cottle, M. L. Kelmanson, & B. Korte (Eds.), Mathematical programming: Proceedings of the international congress on mathematical programming, Rio de Janeiro, Brazil, 1981 (pp. 13\u201324). Amsterdam: North-Holland."},{"key":"3380_CR14","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., & O\u011fuz, O. (2007). On separating cover inequalities for the multidimensional knapsack problem. Computers & Operations Research, 34, 1771\u20131776.","journal-title":"Computers & Operations Research"},{"key":"3380_CR15","first-page":"121","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D. (1996). Computational study of a family of mixed-integer quadratic programming problems. Mathematical Programming, 74, 121\u2013140.","journal-title":"Mathematical Programming"},{"key":"3380_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.orl.2007.09.003","volume":"36","author":"D Bienstock","year":"2008","unstructured":"Bienstock, D. (2008). Approximate formulations for 0\u20131 knapsack sets. Operations Research Letters, 36, 317\u2013320.","journal-title":"Operations Research Letters"},{"key":"3380_CR17","unstructured":"Boccia, M. (2006). Using exact knapsack separation for the single-source capacitated facility location problem. Technical Report, Department of Engineering, University of Sannio."},{"key":"3380_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/net.3230220507","volume":"22","author":"EA Boyd","year":"1992","unstructured":"Boyd, E. A. (1992). A pseudopolynomial network flow formulation for exact knapsack separation. Networks, 22, 503\u2013514.","journal-title":"Networks"},{"key":"3380_CR19","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"EA Boyd","year":"1993","unstructured":"Boyd, E. A. (1993a). Generating Fenchel cutting planes for knapsack polyhedra. SIAM Journal on Optimization, 3, 734\u2013750.","journal-title":"SIAM Journal on Optimization"},{"key":"3380_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(90)90053-F","volume":"41","author":"EA Boyd","year":"1993","unstructured":"Boyd, E. A. (1993b). Polyhedral results for the precedence-constrained knapsack problem. Discrete Applied Mathematics, 41, 185\u2013201.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"EA Boyd","year":"1994","unstructured":"Boyd, E. A. (1994). Fenchel cutting planes for integer programs. Operations Research, 42, 53\u201364.","journal-title":"Operations Research"},{"key":"3380_CR22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(71)90005-7","volume":"1","author":"GH Bradley","year":"1971","unstructured":"Bradley, G. H. (1971). Transformation of integer programs to knapsack problems. Discrete Mathematics, 1, 29\u201345.","journal-title":"Discrete Mathematics"},{"key":"3380_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01585527","volume":"7","author":"GH Bradley","year":"1974","unstructured":"Bradley, G. H., Hammer, P. L., & Wolsey, L. A. (1974). Coefficient reduction for inequalities in 0\u20131 variables. Mathematical Programming, 7, 263\u2013282.","journal-title":"Mathematical Programming"},{"key":"3380_CR24","first-page":"475","volume":"52","author":"JO Cerdeira","year":"1995","unstructured":"Cerdeira, J. O., & Barcia, P. (1995). When is a 0\u20131 knapsack a matroid? Portugaliae Mathematica, 52, 475\u2013480.","journal-title":"Portugaliae Mathematica"},{"key":"3380_CR25","first-page":"201","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Cordier, C., Marchand, H., & Wolsey, L. A. (1998). Cutting planes for integer programs with general integer variables. Mathematical Programming, 81, 201\u2013214.","journal-title":"Mathematical Programming"},{"key":"3380_CR26","unstructured":"Chen, W.-K., & Dai, Y.-H. (2019). On the complexity of sequentially lifting cover inequalities for the knapsack polytope. Technical Report 1811.10010v2, arXiv."},{"key":"3380_CR27","unstructured":"Chv\u00e1tal, V., & Hammer, P.\u00a0L. (1975). Aggregation of inequalities in integer programming. Technical Report, Stanford University, Stanford, CA, USA."},{"key":"3380_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010). Extended formulations in combinatorial optimization. 4OR: A Quarterly Journal of Operations Research, 8, 1\u201348.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"3380_CR29","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.13.4.543","volume":"13","author":"M Conforti","year":"1988","unstructured":"Conforti, M., & Laurent, M. (1988). On the facial structure of independence system polyhedra. Mathematics of Operations Research, 13, 543\u2013555.","journal-title":"Mathematics of Operations Research"},{"key":"3380_CR30","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. (1983). Solving large-scale zero-one linear programming problems. Operations Research, 31, 803\u2013834.","journal-title":"Operations Research"},{"key":"3380_CR31","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0167-6377(03)00017-8","volume":"31","author":"G Dahl","year":"2003","unstructured":"Dahl, G., & Foldnes, N. (2003). Complete description of a class of knapsack polytopes. Operations Research Letters, 31, 335\u2013340.","journal-title":"Operations Research Letters"},{"key":"3380_CR32","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G. B. (1957). Discrete-variable extremum problems. Operations Research, 5, 266\u2013288.","journal-title":"Operations Research"},{"key":"3380_CR33","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"IR de Farias Jr","year":"2003","unstructured":"de Farias Jr, I. R., & Nemhauser, G. L. (2003). A polyhedral study of the cardinality constrained knapsack problem. Mathematical Programming, 96, 439\u2013467.","journal-title":"Mathematical Programming"},{"key":"3380_CR34","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(92)90085-N","volume":"60","author":"B Dietrich","year":"1992","unstructured":"Dietrich, B., & Escudero, L. (1992). On tightening cover induced inequalities. European Journal of Operational Research, 60, 335\u2013343.","journal-title":"European Journal of Operational Research"},{"key":"3380_CR35","unstructured":"Dyer, M. (2003). Approximate counting by dynamic programming. In: Proceedings of the 35th ACM symposium on theory of computing (pp.\u00a0693\u2013699). New York: ACM."},{"key":"3380_CR36","first-page":"158","volume":"4","author":"T Easton","year":"2015","unstructured":"Easton, T., & Gutierrez, T. (2015). Sequential lifting of general integer variables for integer programs. Industrial Engineering and Management, 4, 158.","journal-title":"Industrial Engineering and Management"},{"key":"3380_CR37","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.disopt.2007.05.003","volume":"5","author":"T Easton","year":"2008","unstructured":"Easton, T., & Hooker, K. (2008). Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes. Discrete Optimization, 5, 254\u2013261.","journal-title":"Discrete Optimization"},{"key":"3380_CR38","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-003-0401-y","volume":"98","author":"T Easton","year":"2003","unstructured":"Easton, T., Hooker, K., & Lee, E. K. (2003). Facets of the independent set polytope. Mathematical Programming, 98, 177\u2013199.","journal-title":"Mathematical Programming"},{"key":"3380_CR39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J. (1971). Matroids and the greedy algorithm. Mathematical Programming, 1, 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"3380_CR40","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.orl.2015.04.004","volume":"43","author":"Y Faenza","year":"2015","unstructured":"Faenza, Y., & Sanit\u00e0, L. (2015). On the existence of compact $$\\varepsilon $$-approximated formulations for knapsack in the original space. Operations Research Letters, 43, 339\u2013342.","journal-title":"Operations Research Letters"},{"key":"3380_CR41","unstructured":"Ferreira, C.\u00a0E. (1994). On combinatorial optimization problems arising in computer systems design. Ph.D. thesis, TU Berlin."},{"key":"3380_CR42","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"CE Ferreira","year":"1996","unstructured":"Ferreira, C. E., Martin, A., & Weismantel, R. (1996). Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization, 6, 858\u2013877.","journal-title":"SIAM Journal on Optimization"},{"key":"3380_CR43","unstructured":"Fukasawa, R. (2008). Single-row mixed-integer programs: Theory and computations. Ph.D. thesis, Georgia Institute of Technology."},{"key":"3380_CR44","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10107-009-0284-7","volume":"128","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., & Goycoolea, M. (2011). On the exact separation of mixed integer knapsack cuts. Mathematical Programming, 128, 19\u201341.","journal-title":"Mathematical Programming"},{"key":"3380_CR45","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. (2002). A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Operations Research Letters, 30, 252\u2013264.","journal-title":"Operations Research Letters"},{"key":"3380_CR46","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-0348-8438-9_2","volume-title":"Polytopes\u2014Combinatorics and computation (Oberwolfach, 1997). DMV seminars","author":"E Gawrilow","year":"2000","unstructured":"Gawrilow, E., & Joswig, M. (2000). polymake: A framework for analyzing convex polytopes. In G. Kalai & G. M. Ziegler (Eds.), Polytopes\u2014Combinatorics and computation (Oberwolfach, 1997). DMV seminars (Vol. 29, pp. 43\u201373). Basel: Birkh\u00e4user."},{"key":"3380_CR47","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/0305-0548(92)90019-2","volume":"19","author":"D Geist","year":"1992","unstructured":"Geist, D., & Rodin, E. Y. (1992). Adjacency of the 0\u20131 knapsack problem. Computers & Operations Research, 19, 797\u2013800.","journal-title":"Computers & Operations Research"},{"key":"3380_CR48","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(80)90119-3","volume":"30","author":"R Giles","year":"1980","unstructured":"Giles, R., & Kannan, R. (1980). A characterization of threshold matroids. Discrete Mathematics, 30, 181\u2013184.","journal-title":"Discrete Mathematics"},{"key":"3380_CR49","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.jcta.2005.07.010","volume":"113","author":"R Gillmann","year":"2006","unstructured":"Gillmann, R., & Kaibel, V. (2006). Revlex-initial 0\/1-polytopes. Journal of Combinatorial Theory, Series A, 113, 799\u2013821.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"3380_CR50","unstructured":"Glover, F. (1973). Unit coefficient inequalities for zero-one programming. Technical Report, University of Colorado."},{"key":"3380_CR51","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-007-0098-4","volume":"114","author":"F Glover","year":"2008","unstructured":"Glover, F., & Sherali, H. D. (2008). Second-order cover inequalities. Mathematical Programming, 114, 207\u2013234.","journal-title":"Mathematical Programming"},{"key":"3380_CR52","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008621204567","volume":"8","author":"F Glover","year":"1997","unstructured":"Glover, F., Sherali, H. D., & Lee, Y. (1997). Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Computational Optimization and Applications, 8, 151\u2013172.","journal-title":"Computational Optimization and Applications"},{"key":"3380_CR53","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.disopt.2015.03.003","volume":"17","author":"EI Gokce","year":"2015","unstructured":"Gokce, E. I., & Wilhelm, W. E. (2015). Valid inequalities for the multi-dimensional multiple-choice 0\u20131 knapsack problem. Discrete Optimization, 17, 25\u201354.","journal-title":"Discrete Optimization"},{"key":"3380_CR54","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-6377(88)90073-9","volume":"7","author":"ES Gottlieb","year":"1988","unstructured":"Gottlieb, E. S., & Rao, M. R. (1988). Facets of the knapsack polytope derived from disjoint and overlapping index configurations. Operations Research Letters, 7, 95\u2013100.","journal-title":"Operations Research Letters"},{"key":"3380_CR55","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01585726","volume":"46","author":"ES Gottlieb","year":"1990","unstructured":"Gottlieb, E. S., & Rao, M. R. (1990a). $$(1, k)$$-configuration facets for the generalized assignment problem. Mathematical Programming, 46, 53\u201360.","journal-title":"Mathematical Programming"},{"key":"3380_CR56","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"ES Gottlieb","year":"1990","unstructured":"Gottlieb, E. S., & Rao, M. R. (1990b). The generalized assignment problem: Valid inequalities and facets. Mathematical Programming, 46, 31\u201352.","journal-title":"Mathematical Programming"},{"key":"3380_CR57","unstructured":"Goycoolea, M. (2006). Cutting planes for large mixed integer programming models. Ph.D. thesis, Georgia Institute of Technology."},{"key":"3380_CR58","unstructured":"Gu, Z. (1995). Lifted cover inequalities for 0\u20131 and mixed 0\u20131 integer programs. Ph.D. thesis, Georgia Institute of Technology."},{"key":"3380_CR59","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. (1998). Lifted cover inequalities for 0\u20131 integer programs: Computation. INFORMS Journal on Computing, 10, 427\u2013437.","journal-title":"INFORMS Journal on Computing"},{"key":"3380_CR60","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. (1999a). Lifted cover inequalities for 0\u20131 integer programs: Complexity. INFORMS Journal on Computing, 11, 117\u2013123.","journal-title":"INFORMS Journal on Computing"},{"key":"3380_CR61","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G. L., & Savelsbergh, M. W. P. (1999b). Lifted flow cover inequalities for mixed 0\u20131 integer programs. Mathematical Programming, 85, 439\u2013467.","journal-title":"Mathematical Programming"},{"key":"3380_CR62","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. (2000). Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization, 4, 109\u2013129.","journal-title":"Journal of Combinatorial Optimization"},{"key":"3380_CR63","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.dam.2015.08.010","volume":"201","author":"A Gupte","year":"2016","unstructured":"Gupte, A. (2016). Convex hulls of superincreasing knapsacks and lexicographic orderings. Discrete Applied Mathematics, 201, 150\u2013163.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR64","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer, P. L., Johnson, E. L., & Peled, U. N. (1975). Facet of regular 0\u20131 polytopes. Mathematical Programming, 8, 179\u2013206.","journal-title":"Mathematical Programming"},{"key":"3380_CR65","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1137\/0132059","volume":"32","author":"PL Hammer","year":"1977","unstructured":"Hammer, P. L., Johnson, E. L., & Peled, U. N. (1977). The role of master polytopes in the unit cube. SIAM Journal on Applied Mathematics, 32, 711\u2013716.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"3380_CR66","first-page":"243","volume":"26","author":"PL Hammer","year":"1982","unstructured":"Hammer, P. L., & Peled, U. N. (1982). Computing low-capacity 0\u20131 knapsack polytopes. Zeitschrift f\u00fcr Operations Research, 26, 243\u2013249.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"3380_CR67","unstructured":"Hartmann, M. (1994). Cutting planes and the sequential knapsack problem. Technical Report, TR-94\/10, University of North Carolina."},{"key":"3380_CR68","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(92)90162-4","volume":"39","author":"D Hartvigsen","year":"1992","unstructured":"Hartvigsen, D., & Zemel, E. (1992). The complexity of lifted inequalities for the knapsack problem. Discrete Applied Mathematics, 39, 113\u2013123.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR69","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(83)90067-7","volume":"6","author":"AC Hayes","year":"1982","unstructured":"Hayes, A. C., & Larman, D. G. (1982). The vertices of the knapsack polytope. Discrete Applied Mathematics, 6, 135\u2013138.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR70","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1504\/IJOR.2015.071495","volume":"24","author":"R Hickman","year":"2015","unstructured":"Hickman, R., & Easton, T. (2015a). Merging valid inequalities over the multiple knapsack polyhedron. International Journal of Operational Research, 24, 214\u2013227.","journal-title":"International Journal of Operational Research"},{"key":"3380_CR71","doi-asserted-by":"crossref","first-page":"141","DOI":"10.4236\/ojop.2015.44014","volume":"4","author":"R Hickman","year":"2015","unstructured":"Hickman, R., & Easton, T. (2015b). On merging cover inequalities for multiple knapsack problems. Open Journal of Optimization, 4, 141\u2013155.","journal-title":"Open Journal of Optimization"},{"key":"3380_CR72","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"KL Hoffman","year":"1991","unstructured":"Hoffman, K. L., & Padberg, M. (1991). Improving LP-representations of zero-one linear programs for branch-and-cut. INFORMS Journal on Computing, 3, 121\u2013134.","journal-title":"INFORMS Journal on Computing"},{"key":"3380_CR73","unstructured":"Hojny, C. (2018). Symmetries in binary programs\u2014A polyhedral perspective. Ph.D. thesis, TU Darmstadt."},{"key":"3380_CR74","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10107-018-1239-7","volume":"175","author":"C Hojny","year":"2019","unstructured":"Hojny, C., & Pfetsch, M. E. (2019). Polytopes associated with symmetry handling. Mathematical Programming, 175, 197\u2013240.","journal-title":"Mathematical Programming"},{"key":"3380_CR75","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.disopt.2005.06.003","volume":"2","author":"B Hunsaker","year":"2005","unstructured":"Hunsaker, B., & Tovey, C. A. (2005). Simple lifted cover inequalities and hard knapsack problems. Discrete Optimization, 2, 219\u2013228.","journal-title":"Discrete Optimization"},{"key":"3380_CR76","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"EL Johnson","year":"1981","unstructured":"Johnson, E. L., & Padberg, M. W. (1981). A note of the knapsack problem with special ordered sets. Operations Research Letters, 1, 18\u201322.","journal-title":"Operations Research Letters"},{"key":"3380_CR77","first-page":"2","volume":"85","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V. (2011). Extended formulations in combinatorial optimization. Optima, 85, 2\u20137.","journal-title":"Optima"},{"key":"3380_CR78","volume-title":"Progress in combinatorial optimization","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., & Loos, A. (2011). Finding descriptions of polytopes via extended formulations and liftings. In A. R. Mahjoub (Ed.), Progress in combinatorial optimization. Hoboken: Wiley."},{"key":"3380_CR79","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. (2008). Local and global lifted cover inequalities for the 0\u20131 multidimensional knapsack problem. European Journal of Operational Research, 186, 91\u2013103.","journal-title":"European Journal of Operational Research"},{"key":"3380_CR80","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K Kaparis","year":"2010","unstructured":"Kaparis, K., & Letchford, A. N. (2010). Separation algorithms for 0\u20131 knapsack polytopes. Mathematical Programming, 124, 69\u201391.","journal-title":"Mathematical Programming"},{"key":"3380_CR81","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"3380_CR82","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., & Tovey, C. (1998). The complexity of cover inequality separation. Operations Research Letters, 23, 35\u201340.","journal-title":"Operations Research Letters"},{"key":"3380_CR83","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial optimization. Theory and algorithms, Vol.\u00a021 of Algorithms and Combinatorics","author":"B Korte","year":"2012","unstructured":"Korte, B., & Vygen, J. (2012). Combinatorial optimization. Theory and algorithms, Vol.\u00a021 of Algorithms and Combinatorics. Heidelberg: Springer."},{"key":"3380_CR84","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01589098","volume":"45","author":"M Laurent","year":"1989","unstructured":"Laurent, M. (1989). A generalization of antiwebs to independence systems and their canonical facets. Mathematical Programming, 45, 97\u2013108.","journal-title":"Mathematical Programming"},{"key":"3380_CR85","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(92)90041-Z","volume":"11","author":"M Laurent","year":"1992","unstructured":"Laurent, M., & Sassano, A. (1992). A characterization of knapsacks with the max-flow\u2013min-cut property. Operations Research Letters, 11, 105\u2013110.","journal-title":"Operations Research Letters"},{"key":"3380_CR86","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1022624122832","volume":"94","author":"EK Lee","year":"1997","unstructured":"Lee, E. K. (1997). On facets of knapsack equality polytopes. Journal of Optimization Theory and Applications, 94, 223\u2013239.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3380_CR87","doi-asserted-by":"crossref","first-page":"74","DOI":"10.7232\/JKIIE.2012.38.2.074","volume":"38","author":"K Lee","year":"2012","unstructured":"Lee, K. (2012). Separation heuristic for the rank-1 Chvatal\u2013Gomory inequalities for the binary knapsack problem. Journal of the Korean Institute of Industrial Engineering, 38, 74\u201379.","journal-title":"Journal of the Korean Institute of Industrial Engineering"},{"key":"3380_CR88","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.orl.2018.12.005","volume":"47","author":"AN Letchford","year":"2019","unstructured":"Letchford, A. N., & Souli, G. (2019). On lifted cover inequalities: A new lifting procedure with unusual properties. Operations Research Letters, 47, 83\u201387.","journal-title":"Operations Research Letters"},{"key":"3380_CR89","unstructured":"Loos, A. (2010) Describing orbitopes by linear inequalities and projection based tools. Ph.D. thesis, University of Magdeburg."},{"key":"3380_CR90","unstructured":"Loos, A. (2011). Describing orbitopes by linear inequalities and projection based tools. Ph.D. thesis, Universit\u00e4t Magdeburg."},{"key":"3380_CR91","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10107-006-0045-9","volume":"113","author":"Q Louveaux","year":"2008","unstructured":"Louveaux, Q., & Weismantel, R. (2008). Polyhedral properties for the intersection of two knapsacks. Mathematical Programming, 113, 15\u201337.","journal-title":"Mathematical Programming"},{"key":"3380_CR92","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., & Wolsey, L. (2002). Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics, 123, 397\u2013446.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR93","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., & Wolsey, L. A. (1999). The 0\u20131 knapsack problem with a single continuous variable. Mathematical Programming, 85, 15\u201333.","journal-title":"Mathematical Programming"},{"key":"3380_CR94","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., & Wolsey, L. A. (2001). Aggregation and mixed integer rounding to solve MIPs. Operations Research, 49, 363\u2013371.","journal-title":"Operations Research"},{"key":"3380_CR95","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O Marcotte","year":"1985","unstructured":"Marcotte, O. (1985). The cutting stock problem and integer rounding. Mathematical Programming, 33, 82\u201392.","journal-title":"Mathematical Programming"},{"key":"3380_CR96","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. Chichester: Wiley."},{"key":"3380_CR97","unstructured":"Martin, A. (1998). Integer programs with block structure. Habilitation thesis, TU Berlin."},{"key":"3380_CR98","unstructured":"Martin, A., & Weismantel, R. (1997) Contributions to general mixed integer knapsack problems. Technical Report SC-97-38, Zuse Institute Berlin."},{"key":"3380_CR99","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-69346-7_19","volume-title":"Integer programming and combinatorial optimization","author":"A Martin","year":"1998","unstructured":"Martin, A., & Weismantel, R. (1998). The intersection of knapsack polyhedra and extensions. In R. E. Bixby, E. A. Boyd, & R. Z. R\u00edos-Mercado (Eds.), Integer programming and combinatorial optimization (pp. 243\u2013256). Berlin: Springer."},{"key":"3380_CR100","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"RK Martin","year":"1990","unstructured":"Martin, R. K., Rardin, R. L., & Campbell, B. A. (1990). Polyhedral characterization of discrete dynamic programming. Operations Research, 38, 127\u2013138.","journal-title":"Operations Research"},{"key":"3380_CR101","unstructured":"Mazur, D.\u00a0R., & Hall, L.\u00a0A. (2002). Facets of a polyhedron closely related to the integer knapsack-cover problem. Technical Report, Optimization Online. Retrieved 01, 2019, from http:\/\/www.optimization-online.org\/DB_FILE\/2002\/10\/542.pdf ."},{"key":"3380_CR102","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6377(94)90038-8","volume":"16","author":"GL Nemhauser","year":"1994","unstructured":"Nemhauser, G. L., & Vance, P. H. (1994). Lifted cover facets of the 0\u20131 knapsack polytope with GUB constraints. Operations Research Letters, 16, 255\u2013263.","journal-title":"Operations Research Letters"},{"key":"3380_CR103","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1999). Integer and combinatorial optimization. New York: Wiley."},{"key":"3380_CR104","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"MW Padberg","year":"1975","unstructured":"Padberg, M. W. (1975). A note on zero\u2013one programming. Operations Research, 23, 833\u2013837.","journal-title":"Operations Research"},{"key":"3380_CR105","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"MW Padberg","year":"1980","unstructured":"Padberg, M. W. (1980). $$(1, k)$$-configurations and facets for packing problems. Mathematical Programming, 18, 94\u201399.","journal-title":"Mathematical Programming"},{"key":"3380_CR106","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., & Yannakakis, M. (1984). The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28, 244\u2013259.","journal-title":"Journal of Computer and System Sciences"},{"key":"3380_CR107","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"CH Papadimitriou","year":"1988","unstructured":"Papadimitriou, C. H., & Wolfe, D. (1988). The complexity of facets resolved. Journal of Computer and System Sciences, 37, 2\u201313.","journal-title":"Journal of Computer and System Sciences"},{"key":"3380_CR108","first-page":"43","volume":"36","author":"K Park","year":"2011","unstructured":"Park, K., & Lee, K. (2011). On the separation of the rank-1 Chvatal\u2013Gomory inequalities for the fixed-charge 0\u20131 knapsack polytope. Journal of the Korean OR\/MS Society, 36, 43\u201350.","journal-title":"Journal of the Korean OR\/MS Society"},{"key":"3380_CR109","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(95)00113-6","volume":"72","author":"K Park","year":"1997","unstructured":"Park, K., & Park, S. (1997). Lifting cover inequalities for the precedence-constrained knapsack problem. Discrete Applied Mathematics, 72, 219\u2013241.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR110","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0167-5060(08)70751-9","volume-title":"Studies in integer programming, Vol.\u00a01 of Annals of Discrete Mathematics","author":"UN Peled","year":"1977","unstructured":"Peled, U. N. (1977). Properties of facets of binary polytopes. In P. Hammer, E. Johnson, B. Korte, & G. Nemhauser (Eds.), Studies in integer programming, Vol.\u00a01 of Annals of Discrete Mathematics (pp. 435\u2013456). Amsterdam: Elsevier."},{"key":"3380_CR111","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/S1052623495285217","volume":"8","author":"Y Pochet","year":"1998","unstructured":"Pochet, Y., & Weismantel, R. (1998). The sequential knapsack polytope. SIAM Journal on Optimization, 8, 248\u2013264.","journal-title":"SIAM Journal on Optimization"},{"key":"3380_CR112","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y Pochet","year":"1995","unstructured":"Pochet, Y., & Wolsey, L. A. (1995). Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation. Discrete Applied Mathematics, 59, 57\u201374.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR113","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.orl.2013.03.010","volume":"41","author":"S Pokutta","year":"2013","unstructured":"Pokutta, S., & Vyve, M. V. (2013). A note on the extension complexity of the knapsack polytope. Operations Research Letters, 41, 347\u2013350.","journal-title":"Operations Research Letters"},{"key":"3380_CR114","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J-PP Richard","year":"2003","unstructured":"Richard, J.-P. P., de Farias Jr, I. R., & Nemhauser, G. L. (2003a). Lifted inequalities for 0\u20131 mixed integer programming: Basic theory and algorithms. Mathematical Programming, 98, 89\u2013113.","journal-title":"Mathematical Programming"},{"key":"3380_CR115","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-003-0399-1","volume":"98","author":"J-PP Richard","year":"2003","unstructured":"Richard, J.-P. P., de Farias Jr, I. R., & Nemhauser, G. L. (2003b). Lifted inequalities for 0\u20131 mixed integer programming: Superlinear lifting. Mathematical Programming, 98, 115\u2013143.","journal-title":"Mathematical Programming"},{"key":"3380_CR116","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"TJV Roy","year":"1986","unstructured":"Roy, T. J. V., & Wolsey, L. A. (1986). Valid inequalities for mixed 0\u20131 programs. Discrete Applied Mathematics, 14, 199\u2013213.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR117","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"A Sassano","year":"1989","unstructured":"Sassano, A. (1989). On the facial structure of the set covering polytope. Mathematical Programming, 44, 181\u2013202.","journal-title":"Mathematical Programming"},{"key":"3380_CR118","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A. (1986). Theory of linear and integer programming. Chichester: Wiley."},{"key":"3380_CR119","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.disopt.2007.02.002","volume":"5","author":"HD Sherali","year":"2008","unstructured":"Sherali, H. D., & Glover, F. (2008). Higher-order cover cuts from zero\u2013one knapsack constraints augmented by two-sided bounding inequalities. Discrete Optimization, 5, 270\u2013289.","journal-title":"Discrete Optimization"},{"key":"3380_CR120","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"HD Sherali","year":"1995","unstructured":"Sherali, H. D., & Lee, Y. (1995). Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM Journal on Discrete Mathematics, 8, 133\u2013153.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3380_CR121","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10107-016-1050-2","volume":"162","author":"S Shim","year":"2017","unstructured":"Shim, S., Chopra, S., & Cao, W. (2017). The worst case analysis of strong knapsack facets. Mathematical Programming, 162, 465\u2013493.","journal-title":"Mathematical Programming"},{"key":"3380_CR122","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(97)89210-4","volume":"77","author":"JI Stallaert","year":"1997","unstructured":"Stallaert, J. I. (1997). The complementary class of generalized flow cover inequalities. Discrete Applied Mathematics, 77, 73\u201380.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR123","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","volume":"39","author":"MA Trick","year":"1992","unstructured":"Trick, M. A. (1992). A linear relaxation heuristic for the generalized assignment problem. Naval Research Logistics (NRL), 39, 137\u2013151.","journal-title":"Naval Research Logistics (NRL)"},{"key":"3380_CR124","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-642-13036-6_10","volume-title":"Integer programming and combinatorial optimization","author":"S Tyber","year":"2010","unstructured":"Tyber, S., & Johnson, E. L. (2010). A polyhedral study of the mixed integer cut. In F. Eisenbrand & F. B. Shepherd (Eds.), Integer programming and combinatorial optimization (pp. 124\u2013134). Berlin: Springer."},{"key":"3380_CR125","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s101070050084","volume":"86","author":"RLMJ van de Leensel","year":"1999","unstructured":"van de Leensel, R. L. M. J., van Hoesel, C. P. M., & van de Klundert, J. J. (1999). Lifting valid inequalities for the precedence constrained knapsack problem. Mathematical Programming, 86, 161\u2013185.","journal-title":"Mathematical Programming"},{"key":"3380_CR126","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","volume":"105","author":"M Van Vyve","year":"2006","unstructured":"Van Vyve, M., & Wolsey, L. A. (2006). Approximate extended formulations. Mathematical Programming, 105, 501\u2013522.","journal-title":"Mathematical Programming"},{"key":"3380_CR127","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1134\/S1064230709010067","volume":"48","author":"IL Vasilyev","year":"2009","unstructured":"Vasilyev, I. L. (2009). A cutting plane method for knapsack polytope. Journal of Computer and Systems Sciences International, 48, 70\u201377.","journal-title":"Journal of Computer and Systems Sciences International"},{"key":"3380_CR128","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-015-0294-3","volume":"66","author":"IL Vasilyev","year":"2016","unstructured":"Vasilyev, I. L., Boccia, M., & Hanafi, S. (2016). An implementation of exact knapsack separation. Journal of Global Optimization, 66, 127\u2013150.","journal-title":"Journal of Global Optimization"},{"key":"3380_CR129","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1287\/moor.21.4.886","volume":"21","author":"R Weismantel","year":"1996","unstructured":"Weismantel, R. (1996). Hilbert bases and the facets of special knapsack polytopes. Mathematics of Operations Research, 21, 886\u2013904.","journal-title":"Mathematics of Operations Research"},{"key":"3380_CR130","first-page":"49","volume":"77","author":"R Weismantel","year":"1997","unstructured":"Weismantel, R. (1997). On the 0\/1 knapsack polytope. Mathematical Programming, 77, 49\u201368.","journal-title":"Mathematical Programming"},{"key":"3380_CR131","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L. A. (1975). Faces for a linear inequality in 0\u20131 variables. Mathematical Programming, 8, 165\u2013178.","journal-title":"Mathematical Programming"},{"key":"3380_CR132","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"LA Wolsey","year":"1976","unstructured":"Wolsey, L. A. (1976a). Technical note\u2014Facets and strong valid inequalities for integer programs. Operations Research, 24, 367\u2013372.","journal-title":"Operations Research"},{"key":"3380_CR133","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"LA Wolsey","year":"1976","unstructured":"Wolsey, L. A. (1976b). Technical note\u2014Facets and strong valid inequalities for integer programs. Operations Research, 24, 367\u2013372.","journal-title":"Operations Research"},{"key":"3380_CR134","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"LA Wolsey","year":"1977","unstructured":"Wolsey, L. A. (1977). Valid inequalities and superadditivity for 0\u20131 integer programs. Mathematics of Operations Research, 2, 66\u201377.","journal-title":"Mathematics of Operations Research"},{"key":"3380_CR135","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"29","author":"LA Wolsey","year":"1990","unstructured":"Wolsey, L. A. (1990). Valid inequalities for 0\u20131 knapsacks and MIPs with generalised upper bound constraints. Discrete Applied Mathematics, 29, 251\u2013261.","journal-title":"Discrete Applied Mathematics"},{"key":"3380_CR136","unstructured":"Wolter, K. (2006). Implementation of cutting plane separators for mixed integer programs. Diploma thesis, TU Berlin. Retrieved 01, 2019, from https:\/\/www.zib.de\/groetschel\/students\/Diplom-Wolter-2006.pdf ."},{"key":"3380_CR137","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/050639624","volume":"21","author":"H Yaman","year":"2007","unstructured":"Yaman, H. (2007). The integer knapsack cover polyhedron. SIAM J. Discrete Math., 21, 551\u2013572.","journal-title":"SIAM J. Discrete Math."},{"key":"3380_CR138","first-page":"257","volume":"81","author":"X-Q Yan","year":"1998","unstructured":"Yan, X.-Q., & Boyd, E. A. (1998). Cutting planes for mixed-integer knapsack polyhedra. Mathematical Programming, 81, 257\u2013262.","journal-title":"Mathematical Programming"},{"key":"3380_CR139","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E Zemel","year":"1978","unstructured":"Zemel, E. (1978). Lifting the facets of zero-one polytopes. Mathematical Programming, 15, 268\u2013277.","journal-title":"Mathematical Programming"},{"key":"3380_CR140","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E Zemel","year":"1989","unstructured":"Zemel, E. (1989). Easily computable facets of the knapsack polytope. Mathematics of Operations Research, 14, 760\u2013765.","journal-title":"Mathematics of Operations Research"},{"key":"3380_CR141","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.disopt.2010.09.005","volume":"8","author":"B Zeng","year":"2011","unstructured":"Zeng, B., & Richard, J.-P. P. (2011a). A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting. Discrete Optimization, 8, 277\u2013301.","journal-title":"Discrete Optimization"},{"key":"3380_CR142","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.disopt.2010.09.004","volume":"8","author":"B Zeng","year":"2011","unstructured":"Zeng, B., & Richard, J.-P. P. (2011b). A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting. Discrete Optimization, 8, 259\u2013276.","journal-title":"Discrete Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03380-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03380-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03380-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T14:16:17Z","timestamp":1695219377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03380-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,19]]},"references-count":142,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["3380"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03380-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,19]]},"assertion":[{"value":"19 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}