{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:11Z","timestamp":1742913611555,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_11","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"148-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lifting Convex Inequalities for Bipartite Bilinear Programs"],"prefix":"10.1007","author":[{"given":"Xiaoyi","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Philippe P.","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10107-006-0705-9","journal-title":"Math. Program."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.M., Burer, S., Park, K.: Convex hull representations for bounded products of variables. arXiv preprint arXiv:2004.07233 (2020)","DOI":"10.1007\/s10898-021-01046-7"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98(1), 145\u2013175 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0400-z","journal-title":"Math. Program."},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","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":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-009-0282-9","volume":"126","author":"A Atamt\u00fcrk","year":"2011","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Math. Program. 126(2), 351\u2013363 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0282-9","journal-title":"Math. Program."},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-015-0865-6","volume":"154","author":"G Averkov","year":"2015","unstructured":"Averkov, G., Basu, A.: Lifting properties of maximal lattice-free polyhedra. Math. Program. 154(1\u20132), 81\u2013111 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0865-6","journal-title":"Math. Program."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","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(1), 146\u2013164 (1975). https:\/\/doi.org\/10.1007\/BF01580440","journal-title":"Math. Program."},{"issue":"1\u20133","key":"11_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4), 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","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(1), 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"issue":"1\u20132","key":"11_CR11","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10107-012-0560-9","volume":"141","author":"A Basu","year":"2013","unstructured":"Basu, A., Camp\u00ealo, M., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1\u20132), 561\u2013576 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0560-9","journal-title":"Math. Program."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/moor.1110.0536","volume":"37","author":"A Basu","year":"2012","unstructured":"Basu, A., Cornu\u00e9jols, G., K\u00f6ppe, M.: Unique minimal liftings for simplicial polytopes. Math. Oper. Res. 37(2), 346\u2013355 (2012)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/17M1117070","volume":"33","author":"A Basu","year":"2019","unstructured":"Basu, A., Dey, S.S., Paat, J.: Nonunique lifting of integer variables in minimal inequalities. SIAM J. Discrete Math. 33(2), 755\u2013783 (2019)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1137\/140990413","volume":"25","author":"A Basu","year":"2015","unstructured":"Basu, A., Paat, J.: Operations that preserve the covering property of the lifting region. SIAM J. Optim. 25(4), 2313\u20132333 (2015)","journal-title":"SIAM J. Optim."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-020-01484-3","volume":"183","author":"D Bienstock","year":"2020","unstructured":"Bienstock, D., Chen, C., Munoz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183, 1\u201344 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01484-3","journal-title":"Math. Program."},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer, S.: A gentle, geometric introduction to copositive optimization. Math. Program. 151(1), 89\u2013116 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0888-z","journal-title":"Math. Program."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","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. 81(2), 201\u2013214 (1998). https:\/\/doi.org\/10.1007\/BF01581105","journal-title":"Math. Program."},{"issue":"1\u20132","key":"11_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-013-0652-1","volume":"145","author":"K Chung","year":"2014","unstructured":"Chung, K., Richard, J.P.P., Tawarmalani, M.: Lifted inequalities for 0\u20131 mixed-integer bilinear covering sets. Math. Program. 145(1\u20132), 403\u2013450 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0652-1","journal-title":"Math. Program."},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: A geometric perspective on lifting. Oper. Res. 59(3), 569\u2013577 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/ijoc.1080.0284","volume":"21","author":"SS Dey","year":"2009","unstructured":"Dey, S.S., Richard, J.P.P.: Linear-programming-based lifting and its application to primal cutting-plane algorithms. INFORMS J. Comput. 21(1), 137\u2013150 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11081-018-9402-9","volume":"20","author":"SS Dey","year":"2019","unstructured":"Dey, S.S., Santana, A., Wang, Y.: New SOCP relaxation and branching rule for bipartite bilinear programs. Optim. Eng. 20(2), 307\u2013336 (2019)","journal-title":"Optim. Eng."},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.disopt.2010.06.001","volume":"7","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Composite lifting of group inequalities and an application to two-row mixing inequalities. Discrete Optim. 7(4), 256\u2013268 (2010)","journal-title":"Discrete Optim."},{"issue":"6","key":"11_CR24","doi-asserted-by":"publisher","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20(6), 2890\u20132912 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"11_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Program. 124(1\u20132), 143\u2013174 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0362-x","journal-title":"Math. Program."},{"issue":"6","key":"11_CR26","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.orl.2010.08.007","volume":"38","author":"D Espinoza","year":"2010","unstructured":"Espinoza, D., Fukasawa, R., Goycoolea, M.: Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 38(6), 559\u2013563 (2010)","journal-title":"Oper. Res. Lett."},{"key":"11_CR27","unstructured":"G\u00f3mez, A.: Submodularity and valid inequalities in nonlinear optimization with indicator variables (2018)"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3(1), 23\u201385 (1972). https:\/\/doi.org\/10.1007\/BF01584976","journal-title":"Math. Program."},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0\u20131 integer programs. Math. Program. 85(3), 439\u2013467 (1999). https:\/\/doi.org\/10.1007\/s101070050067","journal-title":"Math. Program."},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","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":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90(3), 429\u2013457 (2001). https:\/\/doi.org\/10.1007\/PL00011430","journal-title":"Math. Program."},{"key":"11_CR32","unstructured":"Gupte, A.: Mixed integer bilinear programming with applications to the pooling problem. Ph.D. thesis, Georgia Institute of Technology (2012)"},{"issue":"1","key":"11_CR33","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facet of regular 0\u20131 polytopes. Math. Program. 8(1), 179\u2013206 (1975). https:\/\/doi.org\/10.1007\/BF01580442","journal-title":"Math. Program."},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","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 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 186(1), 91\u2013103 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"11_CR35","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.orl.2015.06.004","volume":"43","author":"M K\u00f6ppe","year":"2015","unstructured":"K\u00f6ppe, M., Zhou, Y.: An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem. Oper. Res. Lett. 43(4), 438\u2013444 (2015)","journal-title":"Oper. Res. Lett."},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: The intersection of knapsack polyhedra and extensions. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 243\u2013256. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69346-7_19"},{"issue":"1","key":"11_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I - convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Program."},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-45771-6_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 307\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_24"},{"issue":"3","key":"11_CR39","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/ijoc.1100.0413","volume":"23","author":"AK Narisetty","year":"2011","unstructured":"Narisetty, A.K., Richard, J.P.P., Nemhauser, G.L.: Lifted tableaux inequalities for 0\u20131 mixed-integer programs: a computational study. INFORMS J. Comput. 23(3), 416\u2013424 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"11_CR40","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10107-017-1138-3","volume":"169","author":"TT Nguyen","year":"2018","unstructured":"Nguyen, T.T., Richard, J.P.P., Tawarmalani, M.: Deriving convex hulls through lifting and projection. Math. Program. 169(2), 377\u2013415 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1138-3","journal-title":"Math. Program."},{"issue":"1","key":"11_CR41","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BF01580121","journal-title":"Math. Program."},{"issue":"4","key":"11_CR42","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"MW Padberg","year":"1975","unstructured":"Padberg, M.W.: A note on zero-one programming. Oper. Res. 23(4), 833\u2013837 (1975)","journal-title":"Oper. Res."},{"issue":"3","key":"11_CR43","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10898-019-00783-0","volume":"74","author":"H Rahman","year":"2019","unstructured":"Rahman, H., Mahajan, A.: Facets of a mixed-integer bilinear covering set with bounds on variables. J. Global Optim. 74(3), 417\u2013442 (2019)","journal-title":"J. Global Optim."},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Richard, J.P.P.: Lifting techniques for mixed integer programming. In: Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0464"},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-540-68279-0_19","volume-title":"50 Years of Integer Programming 1958-2008","author":"J-PP Richard","year":"2010","unstructured":"Richard, J.-P.P., Dey, S.S.: The group-theoretic approach in mixed integer programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 727\u2013801. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_19"},{"issue":"1\u20133","key":"11_CR46","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"JPP 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\u20133), 89\u2013113 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0398-2","journal-title":"Math. Program."},{"issue":"1\u20133","key":"11_CR47","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-003-0399-1","volume":"98","author":"JPP 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\u20133), 115\u2013143 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0399-1","journal-title":"Math. Program."},{"issue":"2","key":"11_CR48","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-007-0190-9","volume":"118","author":"JPP Richard","year":"2009","unstructured":"Richard, J.P.P., Li, Y., Miller, L.A.: Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Program. 118(2), 253\u2013277 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0190-9","journal-title":"Math. Program."},{"issue":"1","key":"11_CR49","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"JPP Richard","year":"2010","unstructured":"Richard, J.P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121(1), 61\u2013104 (2010). https:\/\/doi.org\/10.1007\/s10107-008-0226-9","journal-title":"Math. Program."},{"issue":"4","key":"11_CR50","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1137\/19M1277333","volume":"30","author":"A Santana","year":"2020","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. SIAM J. Optim. 30(4), 2983\u20132997 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"11_CR51","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10107-010-0374-6","volume":"124","author":"M Tawarmalani","year":"2010","unstructured":"Tawarmalani, M., Richard, J.P.P., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1\u20132), 481\u2013512 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0374-6","journal-title":"Math. Program."},{"issue":"2","key":"11_CR52","doi-asserted-by":"publisher","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":"11_CR53","doi-asserted-by":"publisher","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."},{"key":"11_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-72792-7_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"B Zeng","year":"2007","unstructured":"Zeng, B., Richard, J.-P.P.: A framework to derive multidimensional superadditive lifting functions and its applications. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 210\u2013224. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_17"},{"issue":"2","key":"11_CR55","doi-asserted-by":"publisher","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.: A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting. Discrete Optim. 8(2), 277\u2013301 (2011)","journal-title":"Discrete Optim."},{"issue":"2","key":"11_CR56","doi-asserted-by":"publisher","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.: A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting. Discrete Optim. 8(2), 259\u2013276 (2011)","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T10:21:47Z","timestamp":1672050107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}