{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T21:53:37Z","timestamp":1784584417658,"version":"3.55.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Chinese Natural Science Foundation","award":["11631013"],"award-info":[{"award-number":["11631013"]}]},{"name":"Chinese Natural Science Foundation","award":["11826204"],"award-info":[{"award-number":["11826204"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["2015CB856002"],"award-info":[{"award-number":["2015CB856002"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Project to Promote Development of Big Data from National Development and Reform Commission","award":["2016-999999-65-01-000696-01"],"award-info":[{"award-number":["2016-999999-65-01-000696-01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10898-022-01252-x","type":"journal-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T03:02:34Z","timestamp":1670382154000},"page":"205-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lifting for the integer knapsack cover polyhedron"],"prefix":"10.1007","volume":"86","author":[{"given":"Wei-Kun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"1252_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. Thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"2","key":"1252_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T Achterberg","year":"2010","unstructured":"Achterberg, T., Raack, C.: The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs. Math. Program. Comput. 2(2), 125\u2013165 (2010)","journal-title":"Math. Program. Comput."},{"key":"1252_CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization: Festschrift for Martin Gr\u00f6tschel","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization: Festschrift for Martin Gr\u00f6tschel, pp. 449\u2013481. Springer, Berlin (2013)"},{"issue":"1","key":"1252_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-006-0705-9","volume":"109","author":"A Agra","year":"2007","unstructured":"Agra, A., Constantino, M.F.: Lifting two-integer knapsack inequalities. Math. Program. 109(1), 115\u2013154 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding $$\\{0,\\frac{1}{2}\\}$$-cuts in a branch-and-cut framework: a computational study. Informs J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"Informs J. Comput."},{"issue":"1","key":"1252_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-015-0902-5","volume":"154","author":"A Angulo","year":"2015","unstructured":"Angulo, A., Espinoza, D., Palma, R.: Sequence independent lifting for mixed knapsack problems with GUB constraints. Math. Program. 154(1), 55\u201380 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1252_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52(3), 487\u2013490 (2004)","journal-title":"Oper. Res."},{"issue":"1","key":"1252_CR8","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. Oper. Res. 139(1), 21\u201338 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1252_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-009-0265-x","volume":"123","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., G\u00fcnl\u00fck, O.: Mingling: mixed-integer rounding with bounds. Math. Program. 123(2), 315\u2013338 (2010)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1252_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-010-0382-6","volume":"132","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Kianfar, K.: N-step mingling inequalities: new facets for the mixed-integer knapsack set. Math. Program. 132(1\u20132), 79\u201398 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-009-0265-x","volume":"92","author":"A Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A., Rajan, D.: On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. Ser. B 92(2), 315\u2013333 (2002)","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"1252_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{0,\\frac{1}{2}\\}$$-Chv\u00e1tal\u2013Gomory cuts. Math. Program. 74(3), 221\u2013235 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01581105","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Cordier, C., Marchand, H., Wolsey, L.A.: Cutting planes for integer programs with general integer variables. Math. Program. Ser. B 81(2), 201\u2013214 (1998)","journal-title":"Math. Program. Ser. B"},{"key":"1252_CR14","unstructured":"Chen, W.-K., Dai, Y.-H.: Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities. Technical report (2019). https:\/\/arxiv.org\/abs\/1907.03162"},{"issue":"1","key":"1252_CR15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s11425-019-9538-1","volume":"64","author":"W-K Chen","year":"2021","unstructured":"Chen, W.-K., Dai, Y.-H.: On the complexity of sequentially lifting cover inequalities for the knapsack polytope. Sci. China Math. 64(1), 211\u2013220 (2021)","journal-title":"Sci. China Math."},{"key":"1252_CR16","unstructured":"Christophel, P.M.: Separation algorithms for cutting planes based on mixed integer row relaxations. Ph.D. Thesis, Universit\u00e4t Paderborn, Paderborn (2009)"},{"issue":"5","key":"1252_CR17","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.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803\u2013834 (1983)","journal-title":"Oper. Res."},{"issue":"1","key":"1252_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S Dash","year":"2006","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1), 29\u201353 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR19","first-page":"158","volume":"4","author":"T Easton","year":"2015","unstructured":"Easton, T., Gutierrez, T.: Sequential lifting of general integer variables for integer programs. Ind. Eng. Manag 4(2), 158 (2015)","journal-title":"Ind. Eng. Manag"},{"issue":"2","key":"1252_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-004-0520-0","volume":"102","author":"F Eisenbrand","year":"2005","unstructured":"Eisenbrand, F., Laue, S.: A linear algorithm for integer programming in the plane. Math. Program. 102(2), 249\u2013259 (2005)","journal-title":"Math. Program."},{"key":"1252_CR21","unstructured":"Fukasawa, R.: Single-row mixed-integer programs: theory and computations. Ph.D. Thesis, Georgia Institute of Technology (2008)"},{"issue":"3","key":"1252_CR22","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Shinano, Y.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"1252_CR23","unstructured":"Gleixner, A., Maher, S. J., Fischer, T., Gally, T., Gamrath, G., Gottwald, R. L., Hendel, R. L., Koch, T., L\u00fcbbecke, M. E., Miltenberger, M., M\u00fcller, B., Pfetsch, M. E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Weninger, D., Witt, J. T., Witzig, J.: The SCIP optimization suite 6.0. ZIB-Report (2018). https:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/6936"},{"issue":"4","key":"1252_CR24","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\u20131 integer programs: computation. Informs J. Comput. 10(4), 427\u2013437 (1998)","journal-title":"Informs J. Comput."},{"issue":"1","key":"1252_CR25","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. Optim. 4(1), 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1252_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"12","author":"DS Hirschberg","year":"1976","unstructured":"Hirschberg, D.S., Wong, C.K.: A polynomial-time algorithm for the knapsack problem with two variables. J. ACM 12(1), 147\u2013154 (1976)","journal-title":"J. ACM"},{"issue":"1","key":"1252_CR27","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10479-019-03380-2","volume":"292","author":"C Hojny","year":"2020","unstructured":"Hojny, C., Gally, T., Habeck, O., L\u00fcthen, H., Matter, F., Pfetsch, M.E., Schmitt, A.: Knapsack polytopes: a survey. Ann. Oper. Res. 292(1), 469\u2013517 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1252_CR28","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R Kannan","year":"1980","unstructured":"Kannan, R.: A polynomial algorithm for the two-variable integer programming problem. J. ACM 27(1), 118\u2013122 (1980)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"1252_CR29","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.: Separation algorithms for 0\u20131 knapsack polytopes. Math. Program. 124(1\u20132), 69\u201391 (2010)","journal-title":"Math. Program."},{"key":"1252_CR30","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.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"10","key":"1252_CR31","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.dam.2012.02.025","volume":"160","author":"K Kianfar","year":"2012","unstructured":"Kianfar, K.: On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets. Discret. Appl. Math. 160(10), 1567\u20131582 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1252_CR32","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10107-008-0216-y","volume":"120","author":"K Kianfar","year":"2009","unstructured":"Kianfar, K., Fathi, Y.: Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Math. Program. 120(2), 313\u2013346 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103 (2011)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1252_CR34","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00453-008-9218-7","volume":"55","author":"AMCA Koster","year":"2009","unstructured":"Koster, A.M.C.A., Zymolka, A., Kutschka, M.: Algorithms to separate $$\\{0,\\frac{1}{2}\\}$$-Chv\u00e1tal\u2013Gomory cuts. Algorithmica 55(2), 375\u2013391 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"1252_CR35","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s11590-015-0913-4","volume":"10","author":"E Malaguti","year":"2016","unstructured":"Malaguti, E., Dur\u00e1n, R.M., Toth, P.: A metaheuristic framework for nonlinear capacitated covering problems. Optim. Lett. 10(1), 169\u2013180 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"1252_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85(1), 15\u201333 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"1252_CR37","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.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3), 363\u2013371 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"1252_CR38","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O Marcotte","year":"1985","unstructured":"Marcotte, O.: The cutting stock problem and integer rounding. Math. Program. 33(1), 82\u201392 (1985)","journal-title":"Math. Program."},{"key":"1252_CR39","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"key":"1252_CR40","unstructured":"Martin, A.: Integer Programs with Block Structure. Ph.D. Thesis, Technische Universit\u00e4t Berlin (1998)"},{"key":"1252_CR41","unstructured":"Mazur, D. R.: Integer programming approaches to a multifacility location problem. Ph.D. Thesis, The Johns Hopkins University (1999)"},{"issue":"1","key":"1252_CR42","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Math. Program. 6(1), 48\u201361 (1974)","journal-title":"Math. Program."},{"key":"1252_CR43","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"1\u20133","key":"1252_CR44","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46(1\u20133), 379\u2013390 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"1252_CR45","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199\u2013215 (1973)","journal-title":"Math. Program."},{"issue":"1","key":"1252_CR46","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.: Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discret. Appl. Math. 59(1), 57\u201374 (1995)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1252_CR47","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.: Lifted inequalities for 0\u20131 mixed integer programming: basic theory and algorithms. Math. Program. 98(1), 89\u2013113 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1252_CR48","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.: Lifted inequalities for 0\u20131 mixed integer programming: superlinear lifting. Math. Program. 98(1), 115\u2013143 (2003)","journal-title":"Math. Program."},{"key":"1252_CR49","doi-asserted-by":"crossref","unstructured":"Richard, J.-P.P.: Lifting techniques for mixed integer programming. In: Wiley Encyclopedia of Operations Research and Management Science (2011)","DOI":"10.1002\/9780470400531.eorms0464"},{"issue":"2","key":"1252_CR50","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10107-005-0664-6","volume":"105","author":"S Shebalov","year":"2006","unstructured":"Shebalov, S., Klabjan, D.: Sequence independent lifting for mixed integer programs with variable upper bounds. Math. Program. 105(2), 523\u2013561 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR51","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070200292","volume":"92","author":"SPM Van Hoesel","year":"2002","unstructured":"Van Hoesel, S.P.M., Koster, A.M.C.A., Van De Leensel, R.L.M.J., Savelsbergh, M.W.P.: Polyhedral results for the edge capacity polytope. Math. Program. 92(2), 335\u2013358 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"1252_CR52","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02614517","volume":"77","author":"R Weismantel","year":"1997","unstructured":"Weismantel, R.: On the 0\/1 knapsack polytope. Math. Program. 77(3), 49\u201368 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"1252_CR53","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Program. 8(1), 165\u2013178 (1975)","journal-title":"Math. Program."},{"issue":"2","key":"1252_CR54","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.: Facets and strong valid inequalities for integer programs. Oper. Res. 24(2), 367\u2013372 (1976)","journal-title":"Oper. Res."},{"issue":"1","key":"1252_CR55","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.: Valid inequalities and superadditivity for 0\u20131 integer programs. Math. Oper. Res. 2(1), 66\u201377 (1977)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1252_CR56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-015-0868-3","volume":"156","author":"LA Wolsey","year":"2016","unstructured":"Wolsey, L.A., Yaman, H.: Continuous knapsack sets with divisible capacities. Math. Program. 156(1\u20132), 1\u201320 (2016)","journal-title":"Math. Program."},{"key":"1252_CR57","unstructured":"Wolter, K.: Implementation of cutting plane separators for mixed integer programs. Diploma thesis, Technische Universit\u00e4t Berlin, Berlin (2006)"},{"issue":"2","key":"1252_CR58","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H Yaman","year":"2006","unstructured":"Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. 106(2), 365\u2013390 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"1252_CR59","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/050639624","volume":"21","author":"H Yaman","year":"2007","unstructured":"Yaman, H.: The integer knapsack cover polyhedron. SIAM J. Discret. Math. 21(3), 551\u2013572 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"1252_CR60","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.ejor.2007.02.007","volume":"186","author":"H Yaman","year":"2008","unstructured":"Yaman, H., \u015een, A.: Manufacturer\u2019s mixed pallet design problem. Eur. J. Oper. Res. 186(2), 826\u2013840 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1252_CR61","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(4), 760\u2013764 (1989)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01252-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01252-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01252-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T15:49:37Z","timestamp":1701532177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01252-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,7]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1252"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01252-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,7]]},"assertion":[{"value":"24 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}