{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T14:09:03Z","timestamp":1745849343784,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179526"},{"type":"electronic","value":"9783030179533"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_29","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"385-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Intersection Cuts for Factorable MINLP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7892-3951","authenticated-orcid":false,"given":"Felipe","family":"Serrano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"29_CR1","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). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2011.11.002","volume":"9","author":"E Balas","year":"2012","unstructured":"Balas, E., Qualizza, A.: Monoidal cut strengthening revisited. Discrete Optim. 9(1), 40\u201349 (2012). https:\/\/doi.org\/10.1016\/j.disopt.2011.11.002","journal-title":"Discrete Optim."},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2013a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971). https:\/\/doi.org\/10.1287\/opre.19.1.19","journal-title":"Oper. Res."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/s0167-5060(08)70342-x","volume-title":"Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and V","author":"Egon Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. In: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver, pp. 3\u201351. Elsevier BV (1979). https:\/\/doi.org\/10.1016\/s0167-5060(08)70342-x"},{"issue":"1\u20133","key":"29_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/bf01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/bf01581273","journal-title":"Math. Program."},{"issue":"4","key":"29_CR6","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). https:\/\/doi.org\/10.1016\/0377-2217(80)90106-x","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"29_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"137","author":"E Balas","year":"2011","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1\u20132), 19\u201335 (2011). https:\/\/doi.org\/10.1007\/s10107-011-0483-x","journal-title":"Math. Program."},{"issue":"2","key":"29_CR8","first-page":"427","volume":"18","author":"A Basu","year":"2011","unstructured":"Basu, A., Cornu\u00e9jols, G., Zambelli, G.: Convex sets and minimal sublinear functions. J. Convex Anal. 18(2), 427\u2013432 (2011)","journal-title":"J. Convex Anal."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-1-4614-1927-3_5","volume-title":"Mixed Integer Nonlinear Programming","author":"P Belotti","year":"2011","unstructured":"Belotti, P.: Disjunctive cuts for nonconvex MINLP. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, vol. 154, pp. 117\u2013144. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_5"},{"issue":"4\u20135","key":"29_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., Wchter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009). https:\/\/doi.org\/10.1080\/10556780903087124","journal-title":"Optim. Methods Softw."},{"key":"29_CR11","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. http:\/\/arxiv.org\/abs\/1610.04604"},{"key":"29_CR12","first-page":"521","volume":"18","author":"P Bonami","year":"2011","unstructured":"Bonami, P., Linderoth, J., Lodi, A.: Disjunctive cuts for mixed integer nonlinear programming problems. Prog. Comb. Optim. 18, 521\u2013541 (2011)","journal-title":"Prog. Comb. Optim."},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO. Eur. J. Oper. Res. 252(3), 701\u2013727 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.12.018","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"29_CR14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.2307\/2033889","volume":"16","author":"A Brondsted","year":"1965","unstructured":"Brondsted, A., Rockafellar, R.T.: On the subdifferentiability of convex functions. Proc. Am. Math. Soc. 16(4), 605 (1965). https:\/\/doi.org\/10.2307\/2033889","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10898-016-0443-3","volume":"67","author":"C Buchheim","year":"2016","unstructured":"Buchheim, C., D\u2019Ambrosio, C.: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Glob. Optim. 67(4), 759\u2013786 (2016). https:\/\/doi.org\/10.1007\/s10898-016-0443-3","journal-title":"J. Glob. Optim."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-38527-8_22","volume-title":"Experimental Algorithms","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Traversi, E.: Separable non-convex underestimators for binary quadratic programming. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 236\u2013247. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_22"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/moor.2014.0670","volume":"40","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-generating functions and S-free sets. Math. Oper. Res. 40(2), 276\u2013391 (2015). https:\/\/doi.org\/10.1287\/moor.2014.0670","journal-title":"Math. Oper. Res."},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Oper. Res. Manag. Sci. 16(2), 105\u2013120 (2011). https:\/\/doi.org\/10.1016\/j.sorms.2011.03.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"3","key":"29_CR19","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). https:\/\/doi.org\/10.1287\/opre.1110.0916","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"29_CR20","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."},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-33461-5_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 77\u201388. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_7"},{"issue":"6","key":"29_CR22","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615\u20131637 (2017). https:\/\/doi.org\/10.1287\/opre.2017.1650","journal-title":"Oper. Res."},{"issue":"5","key":"29_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/bf02026599","volume":"18","author":"F Glover","year":"1974","unstructured":"Glover, F.: Polyhedral convexity cuts and negative edge extensions. Zeitschrift fr Oper. Res. 18(5), 181\u2013186 (1974). https:\/\/doi.org\/10.1007\/bf02026599","journal-title":"Zeitschrift fr Oper. Res."},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover, F.: Convexity cuts and cut search. Oper. Res. 21(1), 123\u2013134 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.123","journal-title":"Oper. Res."},{"issue":"4","key":"29_CR25","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10898-018-0646-x","volume":"71","author":"MMF Hasan","year":"2018","unstructured":"Hasan, M.M.F.: An edge-concave underestimator for the global optimization oftwice-differentiable nonconvex problems. J. Glob. Optim. 71(4), 735\u2013752 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0646-x","journal-title":"J. Glob. Optim."},{"issue":"1","key":"29_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/a:1008321729949","volume":"14","author":"O Khamisov","year":"1999","unstructured":"Khamisov, O.: On optimization properties of functions, with a concave minorant. J. Glob. Optim. 14(1), 79\u2013101 (1999). https:\/\/doi.org\/10.1023\/a:1008321729949","journal-title":"J. Glob. Optim."},{"issue":"3","key":"29_CR27","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"MR K\u0131l\u0131n\u00e7","year":"2017","unstructured":"K\u0131l\u0131n\u00e7, M.R., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. Optim. Methods Softw. 33(3), 540\u2013562 (2017). https:\/\/doi.org\/10.1080\/10556788.2017.1350178","journal-title":"Optim. Methods Softw."},{"issue":"4\u20135","key":"29_CR28","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009). https:\/\/doi.org\/10.1080\/10556780902753221","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"29_CR29","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). https:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"issue":"2\u20133","key":"29_CR30","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous\/integerglobal optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0166-2","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"29_CR31","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0866-5","volume":"155","author":"S Modaresi","year":"2015","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Intersection cuts fornonlinear integer programming: convexification techniques for structured sets. Math. Program. 155(1\u20132), 575\u2013611 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0866-5","journal-title":"Math. Program."},{"issue":"4","key":"29_CR32","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/a:1008315229750","volume":"15","author":"M Porembski","year":"1999","unstructured":"Porembski, M.: How to extend the concept of convexity cuts to derive deeper cutting planes. J. Glob. Optim. 15(4), 371\u2013404 (1999). https:\/\/doi.org\/10.1023\/a:1008315229750","journal-title":"J. Glob. Optim."},{"issue":"2","key":"29_CR33","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/a:1011240309783","volume":"20","author":"M Porembski","year":"2001","unstructured":"Porembski, M.: Finitely convergent cutting planes for concave minimization. J. Glob. Optim. 20(2), 109\u2013132 (2001). https:\/\/doi.org\/10.1023\/a:1011240309783","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"29_CR34","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","volume":"124","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1\u20132), 383\u2013411 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0371-9","journal-title":"Math. Program."},{"issue":"2","key":"29_CR35","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2), 359\u2013413 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0340-3","journal-title":"Math. Program."},{"issue":"1","key":"29_CR36","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/bf01582164","volume":"34","author":"S Sen","year":"1986","unstructured":"Sen, S., Sherali, H.D.: Facet inequalities from simple disjunctions in cutting plane theory. Math. Program. 34(1), 72\u201383 (1986). https:\/\/doi.org\/10.1007\/bf01582164","journal-title":"Math. Program."},{"issue":"2","key":"29_CR37","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/bf02591693","volume":"37","author":"S Sen","year":"1987","unstructured":"Sen, S., Sherali, H.D.: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Math. Program. 37(2), 169\u2013183 (1987). https:\/\/doi.org\/10.1007\/bf02591693","journal-title":"Math. Program."},{"issue":"2","key":"29_CR38","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93(2), 247\u2013263 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0308-z","journal-title":"Math. Program."},{"issue":"2","key":"29_CR39","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0581-8","journal-title":"Math. Program."},{"issue":"2\u20133","key":"29_CR40","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10898-014-0176-0","volume":"59","author":"A Tsoukalas","year":"2014","unstructured":"Tsoukalas, A., Mitsos, A.: Multivariate McCormick relaxations. J. Glob. Optim. 59(2\u20133), 633\u2013662 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0176-0","journal-title":"J. Glob. Optim."},{"key":"29_CR41","unstructured":"Tuy, H.: Concave programming with linear constraints. In: Doklady Akademii Nauk, vol. 159, pp. 32\u201335. Russian Academy of Sciences (1964)"},{"issue":"3","key":"29_CR42","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). https:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"key":"29_CR43","doi-asserted-by":"publisher","unstructured":"Wiese, S.: On the interplay of mixed integer linear, mixed integer nonlinear and constraint programming (2016). https:\/\/doi.org\/10.6092\/unibo\/amsdottorato\/7612","DOI":"10.6092\/unibo\/amsdottorato\/7612"}],"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-17953-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:43:45Z","timestamp":1709815425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","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":"Ann Arbor, MI","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","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":"113","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":"29% - 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":"2.5","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)"}}]}}