{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:42Z","timestamp":1742914182182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_25","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"322-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4463-2873","authenticated-orcid":false,"given":"Benjamin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-441X","authenticated-orcid":false,"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6982-062X","authenticated-orcid":false,"given":"Maxime","family":"Gasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9269-633X","authenticated-orcid":false,"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7892-3951","authenticated-orcid":false,"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"25_CR1","unstructured":"MUMPS: Multifrontal massively parallel sparse direct solver. \nhttp:\/\/mumps.enseeiht.fr"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007). \nhttps:\/\/doi.org\/10.14279\/depositonce-1634\n\n. \nURN:nbn:de:kobv:83-opus-16117","DOI":"10.14279\/depositonce-1634"},{"key":"25_CR3","doi-asserted-by":"publisher","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.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10589-016-9851-z","volume":"65","author":"W van Ackooij","year":"2016","unstructured":"van Ackooij, W., Frangioni, A., de Oliveira, W.: Inexact stabilized benders\u2019 decomposition approaches with application to chance-constrained problems with finite support. Comput. Optim. Appl. 65(3), 637\u2013669 (2016). \nhttps:\/\/doi.org\/10.1007\/s10589-016-9851-z","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2013.04.023","volume":"232","author":"B Alidaee","year":"2014","unstructured":"Alidaee, B.: Zero duality gap in surrogate constraint optimization: a concise review of models. Eur. J. Oper. Res. 232(2), 241\u2013248 (2014). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2013.04.023","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"HMB Amor","year":"2009","unstructured":"Amor, H.M.B., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157(6), 1167\u20131184 (2009). \nhttps:\/\/doi.org\/10.1016\/j.dam.2008.06.021","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"25_CR7","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.15.5.915","volume":"15","author":"E Balas","year":"1967","unstructured":"Balas, E.: Discrete programming by the filter method. Oper. Res. 15(5), 915\u2013957 (1967). \nhttps:\/\/doi.org\/10.1287\/opre.15.5.915","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"25_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). \nhttps:\/\/doi.org\/10.1016\/s0166-218x(98)00136-x","journal-title":"Discrete Appl. Math."},{"key":"25_CR9","unstructured":"Banerjee, K.: Generalized Lagrange multipliers in dynamic programming. Ph.D. thesis, University of California, Berkeley (1971)"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0891-4","journal-title":"Math. Program."},{"key":"25_CR11","unstructured":"COIN-OR: CppAD, a package for differentiation of C++ algorithms. \nhttp:\/\/www.coin-or.org\/CppAD"},{"key":"25_CR12","unstructured":"COIN-OR: Ipopt, Interior point optimizer. \nhttp:\/\/www.coin-or.org\/Ipopt"},{"key":"25_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. Society for Industrial and Applied Mathematics, Philadelphia (2000). \nhttps:\/\/doi.org\/10.1137\/1.9780898719857"},{"issue":"5","key":"25_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M Djerdjour","year":"1988","unstructured":"Djerdjour, M., Mathur, K., Salkin, H.M.: A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem. Oper. Res. Lett. 7(5), 253\u2013258 (1988). \nhttps:\/\/doi.org\/10.1016\/0167-6377(88)90041-7","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/bf01581647","volume":"19","author":"ME Dyer","year":"1980","unstructured":"Dyer, M.E.: Calculating surrogate constraints. Math. Program. 19(1), 255\u2013278 (1980). \nhttps:\/\/doi.org\/10.1007\/bf01581647","journal-title":"Math. Program."},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0166-218x(83)90016-1","volume":"5","author":"M Fisher","year":"1983","unstructured":"Fisher, M., Lageweg, B., Lenstra, J., Kan, A.: Surrogate duality relaxation for job shop scheduling. Discrete Appl. Math. 5(1), 65\u201375 (1983). \nhttps:\/\/doi.org\/10.1016\/0166-218x(83)90016-1","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/bf02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish, B., Pirkul, H.: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math. Program. 31(1), 78\u2013105 (1985). \nhttps:\/\/doi.org\/10.1007\/bf02591863","journal-title":"Math. Program."},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Geoffrion, A.M.: Implicit enumeration using an imbedded linear program. Technical report, May 1967. \nhttps:\/\/doi.org\/10.21236\/ad0655444","DOI":"10.21236\/ad0655444"},{"issue":"6","key":"25_CR19","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F.: A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13(6), 879\u2013919 (1965). \nhttps:\/\/doi.org\/10.1287\/opre.13.6.879","journal-title":"Oper. Res."},{"issue":"4","key":"25_CR20","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover, F.: Surrogate constraints. Oper. Res. 16(4), 741\u2013749 (1968). \nhttps:\/\/doi.org\/10.1287\/opre.16.4.741","journal-title":"Oper. Res."},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F Glover","year":"1975","unstructured":"Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23(3), 434\u2013451 (1975). \nhttps:\/\/doi.org\/10.1287\/opre.23.3.434","journal-title":"Oper. Res."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977). \nhttps:\/\/doi.org\/10.1111\/j.1540-5915.1977.tb01074.x","journal-title":"Decis. Sci."},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/a:1023721723676","volume":"9","author":"F Glover","year":"2003","unstructured":"Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9(3), 175\u2013227 (2003). \nhttps:\/\/doi.org\/10.1023\/a:1023721723676","journal-title":"J. Heuristics"},{"key":"25_CR24","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical report. P-1885, The RAND Corporation, June 1960"},{"issue":"5","key":"25_CR25","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programming. Oper. Res. 18(5), 924\u2013939 (1970). \nhttps:\/\/doi.org\/10.1287\/opre.18.5.924","journal-title":"Oper. Res."},{"issue":"4","key":"25_CR26","first-page":"52","volume":"3","author":"IE Grossmann","year":"2002","unstructured":"Grossmann, I.E., Sahinidis, N.V.: Special issue on mixed integer programmingand its application to engineering, part I. Optim. Eng. 3(4), 52\u201376 (2002)","journal-title":"Optim. Eng."},{"key":"25_CR27","unstructured":"Hendel, G.: Empirical analysis of solving phases in mixed integer programming. Master\u2019s thesis, Technische Universit\u00e4t Berlin, August 2014. URN:nbn:de: \nhttp:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-54270"},{"key":"25_CR28","doi-asserted-by":"publisher","unstructured":"Horst, R., Tuy, H.: Global Optimization. Springer, Berlin Heidelberg (1996). DOI: \nhttps:\/\/doi.org\/10.1007\/978-3-662-03199-5","DOI":"10.1007\/978-3-662-03199-5"},{"key":"25_CR29","unstructured":"ILOG, I.: ILOG CPLEX: High-performance software for mathematical programming and optimization. \nhttp:\/\/www.ilog.com\/products\/cplex\/"},{"issue":"4","key":"25_CR30","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley Jr., J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960). \nhttps:\/\/doi.org\/10.1137\/0108053","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"25_CR31","unstructured":"Junttila, T., Kaski, P.: Bliss: a tool for computing automorphism groups and canonical labelings of graphs. (2012). \nhttp:\/\/www.tcs.hut.fi\/Software\/bliss\/"},{"key":"25_CR32","unstructured":"Karwan, M.H.: Surrogate constraint duality and extensions in integer programming. Ph.D. thesis, Georgia Institute of Technology, January 1976"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/bf01588253","volume":"17","author":"MH Karwan","year":"1979","unstructured":"Karwan, M.H., Rardin, R.L.: Some relationships between Lagrangian and surrogate duality in integer programming. Math. Program. 17(1), 320\u2013334 (1979). \nhttps:\/\/doi.org\/10.1007\/bf01588253","journal-title":"Math. Program."},{"issue":"1","key":"25_CR34","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/opre.32.1.52","volume":"32","author":"MH Karwan","year":"1984","unstructured":"Karwan, M.H., Rardin, R.L.: Surrogate dual multiplier search procedures in integer programming. Oper. Res. 32(1), 52\u201369 (1984). \nhttps:\/\/doi.org\/10.1287\/opre.32.1.52","journal-title":"Oper. Res."},{"issue":"2","key":"25_CR35","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/a:1022622231801","volume":"96","author":"SL Kim","year":"1998","unstructured":"Kim, S.L., Kim, S.: Exact algorithm for the surrogate dual of an integer programming problem: subgradient method approach. J. Optim. Theory Appl. 96(2), 363\u2013375 (1998). \nhttps:\/\/doi.org\/10.1023\/a:1022622231801","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"25_CR36","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 \u2013 convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). \nhttps:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"issue":"1\u20133","key":"25_CR37","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/s0012-365x(98)00213-1","volume":"194","author":"O du Merle","year":"1999","unstructured":"du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discrete Math. 194(1\u20133), 229\u2013237 (1999). \nhttps:\/\/doi.org\/10.1016\/s0012-365x(98)00213-1","journal-title":"Discrete Math."},{"key":"25_CR38","unstructured":"MINLP library. \nhttp:\/\/www.minlplib.org\/"},{"issue":"2","key":"25_CR39","doi-asserted-by":"publisher","first-page":"145","DOI":"10.15807\/jorsj.46.145","volume":"46","author":"Y Nakagawa","year":"2003","unstructured":"Nakagawa, Y.: An improved surrogate constraints method for separable nonlinear integer programming. J. Oper. Res. Soc. Jpn 46(2), 145\u2013163 (2003). \nhttps:\/\/doi.org\/10.15807\/jorsj.46.145","journal-title":"J. Oper. Res. Soc. Jpn"},{"issue":"1","key":"25_CR40","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/s0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso, M.G., Lorena, L.A.N.: Lagrangean\/surrogate relaxation for generalized assignment problems. Eur. J. Oper. Res. 114(1), 165\u2013177 (1999). \nhttps:\/\/doi.org\/10.1016\/s0377-2217(98)00038-1","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"25_CR41","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1007\/bf01585752","journal-title":"Math. Program."},{"issue":"1","key":"25_CR42","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/bf01106605","volume":"6","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. J. Glob. Optim. 6(1), 39\u201376 (1995). \nhttps:\/\/doi.org\/10.1007\/bf01106605","journal-title":"J. Glob. Optim."},{"issue":"5","key":"25_CR43","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H Ryoo","year":"1995","unstructured":"Ryoo, H., Sahinidis, N.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995). \nhttps:\/\/doi.org\/10.1016\/0098-1354(94)00097-2","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"25_CR44","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/1520-6750(198706)34:3<431::aid-nav3220340309>3.0.co;2-p","volume":"34","author":"S Sarin","year":"1987","unstructured":"Sarin, S., Karwan, M.H., Rardin, R.L.: A new surrogate dual multiplier search procedure. Naval Res. Logistics 34(3), 431\u2013450 (1987). \nhttps:\/\/doi.org\/10.1002\/1520-6750(198706)34:3<431::aid-nav3220340309>3.0.co;2-p","journal-title":"Naval Res. Logistics"},{"key":"25_CR45","unstructured":"SCIP - Solving Constraint Integer Programs. \nhttp:\/\/scip.zib.de"},{"key":"25_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Springer, New York (1999). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-4388-3"},{"issue":"1\/4","key":"25_CR47","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/a:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22(1\/4), 233\u2013261 (2002). \nhttps:\/\/doi.org\/10.1023\/a:1013819515732","journal-title":"J. Glob. Optim."},{"issue":"3","key":"25_CR48","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/03052158708941094","volume":"12","author":"AB Templeman","year":"1987","unstructured":"Templeman, A.B., Xingsi, L.: A maximum entropy approach to constrained non-linear programming. Eng. Optim. 12(3), 191\u2013205 (1987). \nhttps:\/\/doi.org\/10.1080\/03052158708941094","journal-title":"Eng. Optim."},{"issue":"1\u20132","key":"25_CR49","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1\u20132), 21\u201353 (2018). \nhttps:\/\/doi.org\/10.1007\/s10107-018-1258-4","journal-title":"Math. Program."},{"key":"25_CR50","unstructured":"Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin, Mathematisch-Naturwissenschaftliche Fakult\u00e4t II (2013). \nURN:nbn:de:kobv:11-100208240"},{"issue":"3","key":"25_CR51","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2017","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2017). \nhttps:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"25_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2005). \nhttps:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"11","key":"25_CR53","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1057\/jors.1991.190","volume":"42","author":"L Xingsi","year":"1991","unstructured":"Xingsi, L.: An aggregate constraint method for non-linear programming. J. Oper. Res. Soc. 42(11), 1003\u20131010 (1991). \nhttps:\/\/doi.org\/10.1057\/jors.1991.190","journal-title":"J. Oper. Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:11:52Z","timestamp":1589929912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","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":"126","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":"26% - 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":"26","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}