{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:44:46Z","timestamp":1773384286212,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58942-4_26","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"399-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enumerative Branching with Less Repetition"],"prefix":"10.1007","author":[{"given":"Thiago","family":"Serra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for pseudo-Boolean constraints. J. Artif. Intell. Res. 45, 443\u2013480 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-10428-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2014","unstructured":"Ab\u00edo, I., Stuckey, P.J.: Encoding linear constraints into SAT. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 75\u201391. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10428-7_9"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-68155-7_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Achterberg","year":"2008","unstructured":"Achterberg, T., Heinz, S., Koch, T.: Counting solutions of integer programs using unrestricted subtree detection. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 278\u2013282. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68155-7_22"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74970-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"HR Andersen","year":"2007","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118\u2013132. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74970-7_11"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.G.: Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23, 61\u201369 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"26_CR6","unstructured":"Behle, M.: Binary decision diagrams and integer programming. Ph.D. thesis, Universit\u00e4t des Saarlandes (2007)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-29828-8_3","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D Bergman","year":"2012","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J., Hooker, J.N.: Variable ordering for the application of BDDs to the maximum independent set problem. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 34\u201349. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29828-8_3"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016)","journal-title":"INFORMS J. Comput."},{"key":"26_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A., van Hoeve, W.J., Hooker, J.: Decision Diagrams for Optimization. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"issue":"10","key":"26_CR10","doi-asserted-by":"publisher","first-page":"4700","DOI":"10.1287\/mnsc.2017.2849","volume":"64","author":"D Bergman","year":"2018","unstructured":"Bergman, D., Cire, A.A.: Discrete nonlinear optimization by state-space decompositions. Manag. Sci. 64(10), 4700\u20134720 (2018)","journal-title":"Manag. Sci."},{"key":"26_CR11","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"26_CR12","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"9","key":"26_CR13","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"26_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"R Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/inte.2014.0754","volume":"44","author":"JD Camm","year":"2014","unstructured":"Camm, J.D.: ASP, the art and science of practice: a (very) short course in suboptimization. INFORMS J. Appl. Anal. 44(4), 428\u2013431 (2014)","journal-title":"INFORMS J. Appl. Anal."},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-011-9112-9","volume":"17","author":"G Chu","year":"2012","unstructured":"Chu, G., de la Banda, M.G., Stuckey, P.J.: Exploiting subproblem dominance in constraint programming. Constraints 17(1), 1\u201338 (2012). \nhttps:\/\/doi.org\/10.1007\/s10601-011-9112-9","journal-title":"Constraints"},{"issue":"6","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., van Hoeve, W.J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"key":"26_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11008-0"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-72792-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"E Danna","year":"2007","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 280\u2013294. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72792-7_22"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2009.03.004","volume":"37","author":"E Danna","year":"2009","unstructured":"Danna, E., Woodruff, D.L.: How to select a small set of diverse solutions to mixed integer programming problems. Oper. Res. Lett. 37, 255\u2013260 (2009)","journal-title":"Oper. Res. Lett."},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Davarnia, D., van Hoeve, W.J.: Outer approximation for integer nonlinear programs via decision diagrams (2018). \nhttps:\/\/doi.org\/10.1007\/s10107-020-01475-4","DOI":"10.1007\/s10107-020-01475-4"},{"issue":"12","key":"26_CR22","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/TCAD.2003.819427","volume":"22","author":"R Ebendt","year":"2003","unstructured":"Ebendt, R., Gunther, W., Drechsler, R.: An improved branch and bound algorithm for exact bdd minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(12), 1657\u20131663 (2003)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.1090.0329","volume":"22","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D.: Pruning moves. INFORMS J. Comput. 22(1), 108\u2013119 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"26_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0167-6377(88)90025-9","volume":"7","author":"M Fischetti","year":"1988","unstructured":"Fischetti, M., Toth, P.: A new dominance procedure for combinatorial optimization problems. Oper. Res. Lett. 7(4), 181\u2013187 (1988)","journal-title":"Oper. Res. Lett."},{"key":"26_CR25","unstructured":"GAMS Software GmbH: Getting a list of best integer solutions of my MIP (2017). \nhttps:\/\/support.gams.com\/solver:getting_a_list_of_best_integer_solutions_of_my_mip_model\n\n. Accessed 29 Nov 2019"},{"key":"26_CR26","unstructured":"Gurobi Optimization, LLC: Finding multiple solutions (2019). \nhttps:\/\/www.gurobi.com\/documentation\/8.1\/refman\/finding_multiple_solutions.html\n\n. Accessed 29 Nov 2019"},{"key":"26_CR27","unstructured":"Haus, U.U., Michini, C., Laumanns, M.: Scenario aggregation using binary decision diagrams for stochastic programs with endogenous uncertainty. CoRR abs\/1701.04055 (2017)"},{"key":"26_CR28","unstructured":"Haus, U.U., Michini, C.: Representations of all solutions of Boolean programming problems. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM) (2014)"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-38171-3_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"JN Hooker","year":"2013","unstructured":"Hooker, J.N.: Decision diagrams and dynamic programming. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 94\u2013110. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38171-3_7"},{"key":"26_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)83807-8","volume":"180","author":"K Hosaka","year":"1997","unstructured":"Hosaka, K., Takenaga, Y., Kaneda, T., Yajima, S.: Size of ordered binary decision diagrams representing threshold functions. Theor. Comput. Sci. 180, 47\u201360 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR31","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T Ibaraki","year":"1977","unstructured":"Ibaraki, T.: The power of dominance relations in branch-and-bound algorithms. J. Assoc. Comput. Mach. 24(2), 264\u2013279 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"key":"26_CR32","unstructured":"IBM Corp.: IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX Version 12 Release 8 (2017)"},{"key":"26_CR33","unstructured":"IBM Corp.: How to enumerate all solutions (2019). \nhttps:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.9.0\/ilog.odms.cplex.help\/CPLEX\/UsrMan\/topics\/discr_optim\/soln_pool\/18_howTo.html\n\n. Accessed 29 Nov 2019"},{"key":"26_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-13520-0_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S Jain","year":"2010","unstructured":"Jain, S., Kadioglu, S., Sellmann, M.: upper bounds on the number of solutions of binary integer programs. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 203\u2013218. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13520-0_24"},{"issue":"1","key":"26_CR35","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/321796.321808","volume":"21","author":"W Kohler","year":"1974","unstructured":"Kohler, W., Steiglitz, K.: Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. J. Assoc. Comput. Mach. 21(1), 140\u2013156 (1974)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"26_CR36","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"26_CR37","doi-asserted-by":"publisher","unstructured":"Lozano, L., Smith, J.C.: A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. Math. Program. (2018). \nhttps:\/\/doi.org\/10.1007\/s10107-018-1315-z","DOI":"10.1007\/s10107-018-1315-z"},{"issue":"1","key":"26_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/ijoc.2015.0667","volume":"28","author":"D Morrison","year":"2016","unstructured":"Morrison, D., Sewell, E., Jacobson, S.: Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams. INFORMS J. Comput. 28(1), 67\u201382 (2016)","journal-title":"INFORMS J. Comput."},{"key":"26_CR39","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126, 147\u2013178 (2011). \nhttps:\/\/doi.org\/10.1007\/s10107-009-0273-x","journal-title":"Math. Program."},{"key":"26_CR40","unstructured":"Perez, G., R\u00e9gin, J.C.: Efficient operations on MDDs for building constraint programming models. In: International Joint Conference on Artificial Intelligence (IJCAI) (2015)"},{"issue":"3","key":"26_CR41","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1287\/ijoc.2018.0855","volume":"31","author":"T Petit","year":"2019","unstructured":"Petit, T., Trapp, A.C.: Enriching solutions to combinatorial problems via solution engineering. INFORMS J. Comput. 31(3), 429\u2013444 (2019)","journal-title":"INFORMS J. Comput."},{"key":"26_CR42","unstructured":"Raghunathan, A., Bergman, D., Hooker, J., Serra, T., Kobori, S.: Seamless multimodal transportation scheduling. CoRR abs\/1807.09676 (2018)"},{"key":"26_CR43","unstructured":"Sanner, S., Uther, W., Delgado, K.V.: Approximate dynamic programming with affine ADDs. In: AAMAS (2010)"},{"key":"26_CR44","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-019-01390-3","volume":"182","author":"T Serra","year":"2019","unstructured":"Serra, T., Hooker, J.: Compact representation of near-optimal integer programming solutions. Math. Program. 182, 199\u2013232 (2019). \nhttps:\/\/doi.org\/10.1007\/s10107-019-01390-3","journal-title":"Math. Program."},{"key":"26_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-19212-9_34","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"T Serra","year":"2019","unstructured":"Serra, T., Raghunathan, A.U., Bergman, D., Hooker, J., Kobori, S.: Last-mile scheduling under uncertainty. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 519\u2013528. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19212-9_34"},{"key":"26_CR46","unstructured":"Serra, T., Ramalingam, S.: Empirical bounds on linear regions of deep rectifier networks. CoRR abs\/1810.03370 (2018)"},{"issue":"2","key":"26_CR47","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/ijoc.2018.0830","volume":"31","author":"C Tjandraatmadja","year":"2019","unstructured":"Tjandraatmadja, C., van Hoeve, W.J.: Target cuts from relaxed decision diagrams. INFORMS J. Comput. 31(2), 285\u2013301 (2019)","journal-title":"INFORMS J. Comput."},{"key":"26_CR48","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1080\/0740817X.2015.1019161","volume":"47","author":"AC Trapp","year":"2015","unstructured":"Trapp, A.C., Konrad, R.A.: Finding diverse optima and near-optima to binary integer programs. IIE Trans. 47, 1300\u20131312 (2015)","journal-title":"IIE Trans."},{"key":"26_CR49","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"26_CR50","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"26_CR51","doi-asserted-by":"crossref","unstructured":"Verhaeghe, H., Lecoutre, C., Schaus, P.: Compact-MDD: efficiently filtering (s) MDD constraints with reversible sparse bit-sets. In: IJCAI (2018)","DOI":"10.24963\/ijcai.2018\/192"},{"key":"26_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-030-19212-9_39","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"H Verhaeghe","year":"2019","unstructured":"Verhaeghe, H., Lecoutre, C., Schaus, P.: Extending compact-diagram to basic smart multi-valued variable diagrams. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 581\u2013598. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19212-9_39"},{"key":"26_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-319-93031-2_42","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Z Ye","year":"2018","unstructured":"Ye, Z., Say, B., Sanner, S.: Symbolic bucket elimination for piecewise continuous constrained optimization. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 585\u2013594. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93031-2_42"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:14:20Z","timestamp":1600409660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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":"35% - 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.08","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":"3.08","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)"}}]}}