{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:06:42Z","timestamp":1743034002459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"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_13","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"186-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0497-3059","authenticated-orcid":false,"given":"Katalin","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1439-8702","authenticated-orcid":false,"given":"Markus","family":"Sinnl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-9242","authenticated-orcid":false,"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7428-9770","authenticated-orcid":false,"given":"Sophie","family":"Parragh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009). \nhttps:\/\/doi.org\/10.1007\/s12532-008-0001-1","journal-title":"Math. Program. Comput."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-19212-9_8","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Bofill","year":"2019","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M.: SAT encodings of pseudo-Boolean constraints with at-most-one relations. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 112\u2013128. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19212-9_8"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1996","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Math. Comput. Model. 20, 97\u2013123 (1996)","journal-title":"Math. Comput. Model."},{"key":"13_CR5","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: SLIDE: a useful special case of the CARDPATH constraint. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N.M. (eds.) ECAI 2008\u2013Proceedings of the 18th European Conference on Artificial Intelligence, Patras, Greece, 21\u201325 July 2008, Volume 178 of Frontiers in Artificial Intelligence and Applications, pp. 475\u2013479. IOS Press (2008)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P., Walsh, T.: Encodings of the Sequence constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 210\u2013224. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74970-7_17"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/11889205_44","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"W-J van Hoeve","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: Revisiting the sequence constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 620\u2013634. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11889205_44"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Sinnl, M.: A note on computational approaches for the antibandwidth problem. Cent. Eur. J. Oper. Res. (2020). \nhttps:\/\/doi.org\/10.1007\/s10100-020-00688-4","DOI":"10.1007\/s10100-020-00688-4"},{"issue":"6","key":"13_CR9","first-page":"1","volume":"16","author":"JA Gallian","year":"2009","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 16(6), 1\u2013219 (2009)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"JY Leung","year":"1984","unstructured":"Leung, J.Y., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Comput. 13(3), 650\u2013667 (1984)","journal-title":"SIAM J. Comput."},{"key":"13_CR11","unstructured":"Cappanera, P.: A survey on obnoxious facility location problems (1999)"},{"issue":"12","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y., Kobourov, S.: GMap: visualizing graphs and clusters as maps. In: 2010 IEEE Pacific Visualization Symposium (PacificVis), pp. 201\u2013208. IEEE (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/net.3230190604","volume":"19","author":"Z Miller","year":"1989","unstructured":"Miller, Z., Pritikin, D.: On the separation number of a graph. Networks 19(6), 651\u2013666 (1989)","journal-title":"Networks"},{"issue":"1","key":"13_CR15","first-page":"1","volume":"35","author":"Y Liu","year":"2003","unstructured":"Liu, Y., Yuan, J.: The dual bandwidth problem for graphs. J. Zhengzhou Univ. 35(1), 1\u20135 (2003)","journal-title":"J. Zhengzhou Univ."},{"issue":"11","key":"13_CR16","doi-asserted-by":"publisher","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","volume":"309","author":"A Raspaud","year":"2009","unstructured":"Raspaud, A., Schr\u00f6der, H., S\u1ef3kora, O., Torok, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Math. 309(11), 3541\u20133552 (2009)","journal-title":"Discrete Math."},{"issue":"8","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.dam.2008.12.004","volume":"157","author":"X Wang","year":"2009","unstructured":"Wang, X., Wu, X., Dumitrescu, S.: On explicit formulas for bandwidth and antibandwidth of hypercubes. Discrete Appl. Math. 157(8), 1947\u20131952 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"10\u201311","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1016\/j.dam.2012.12.026","volume":"161","author":"S Dobrev","year":"2013","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of hamming graphs. Discrete Appl. Math. 161(10\u201311), 1402\u20131408 (2013)","journal-title":"Discrete Appl. Math."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2014.06.004","volume":"29","author":"MA Bekos","year":"2014","unstructured":"Bekos, M.A., Kaufmann, M., Kobourov, S., Veeramoni, S.: A note on maximum differential coloring of planar graphs. J. Discrete Algorithms 29, 1\u20137 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10732-010-9124-4","volume":"17","author":"R Bansal","year":"2011","unstructured":"Bansal, R., Srivastava, K.: Memetic algorithm for the antibandwidth maximization problem. J. Heuristics 17(1), 39\u201360 (2011). \nhttps:\/\/doi.org\/10.1007\/s10732-010-9124-4","journal-title":"J. Heuristics"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.20418","volume":"58","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Resende, M.G., Silva, R.M.: GRASP with path relinking heuristics for the antibandwidth problem. Networks 58(3), 171\u2013189 (2011)","journal-title":"Networks"},{"issue":"6","key":"13_CR22","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s10732-012-9213-7","volume":"18","author":"M Lozano","year":"2012","unstructured":"Lozano, M., Duarte, A., Gort\u00e1zar, F., Mart\u00ed, R.: Variable neighborhood search with ejection chains for the antibandwidth problem. J. Heuristics 18(6), 919\u2013938 (2012). \nhttps:\/\/doi.org\/10.1007\/s10732-012-9213-7","journal-title":"J. Heuristics"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/nla.1859","volume":"21","author":"J Scott","year":"2014","unstructured":"Scott, J., Hu, Y.: Level-based heuristics and hill climbing for the antibandwidth maximization problem. Numer. Linear Algebra Appl. 21(1), 51\u201367 (2014)","journal-title":"Numer. Linear Algebra Appl."},{"key":"13_CR24","unstructured":"van den Akker, J.: LP-based solution methods for single-machine scheduling problems. Ph.D. thesis, Technische Universiteit Eindhoven - Department of Mathematics and Computer Science (1994)"},{"issue":"6","key":"13_CR25","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10951-012-0284-y","volume":"16","author":"N Boland","year":"2013","unstructured":"Boland, N., Kalinowski, T., Waterer, H., Zheng, L.: Mixed integer programming based maintenance scheduling for the hunter valley coal chain. J. Sched. 16(6), 649\u2013659 (2013). \nhttps:\/\/doi.org\/10.1007\/s10951-012-0284-y","journal-title":"J. Sched."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.compchemeng.2011.11.004","volume":"38","author":"CT Maravelias","year":"2012","unstructured":"Maravelias, C.T.: On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling. Comput. Chem. Eng. 38, 204\u2013212 (2012)","journal-title":"Comput. Chem. Eng."},{"issue":"6","key":"13_CR27","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., Causmaecker, P.D., Berghe, G.V., Landeghem, H.V.: The state of the art of nurse rostering. J. Sched. 7(6), 441\u2013499 (2004). \nhttps:\/\/doi.org\/10.1023\/B:JOSH.0000046076.75950.0b","journal-title":"J. Sched."},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3\u201327 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR29","unstructured":"Dincbas, M., Simonis, H., Hentenryck, P.V.: Solving the car-sequencing problem in constraint logic programming. In: Kodratoff, Y. (ed.) Proceedings of the 8th European Conference on Artificial Intelligence, ECAI 1988, Munich, Germany, 1\u20135 August 1988, pp. 290\u2013295. Pitmann Publishing, London (1988)"},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. Eur. J. Oper. Res. 191(3), 912\u2013927 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR31","unstructured":"Prestwich, S.D.: CNF encodings. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pp. 75\u201397. IOS Press (2009)"},{"key":"13_CR32","unstructured":"Chen, J.: A new sat encoding of the at-most-one constraint. In: Proceedings of the Constraint Modelling and Reformulation (2010)"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-39611-3_14","volume-title":"Hardware and Software: Verification and Testing","author":"N Manthey","year":"2013","unstructured":"Manthey, N., Heule, M.J.H., Biere, A.: Automated reencoding of Boolean formulas. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 102\u2013117. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39611-3_14"},{"key":"13_CR34","unstructured":"H\u00f6lldobler, S., Nguyen, V.H.: On SAT-encodings of the at-most-one constraint. In: Katsirelos, G., Quimper, C.G. (eds.) Proceedings of the Twelfth International Workshop on Constraint Modelling and Reformulation, Uppsala, Sweden, 16\u201320 September 2013, pp. 1\u201317 (2013)"},{"key":"13_CR35","volume-title":"The Art of Computer Programming, Volume 4B, Fascicle 6: Satisfiability","author":"DE Knuth","year":"2015","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4B, Fascicle 6: Satisfiability. Addison-Wesley, Boston (2015)"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen, V.: SAT encodings of finite-CSP domains: a survey. In: Proceedings of the Eighth International Symposium on Information and Communication Technology, Nha Trang City, Viet Nam, 7\u20138 December 2017, pp. 84\u201391. ACM (2017)","DOI":"10.1145\/3155133.3155167"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11564751_73"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-31612-8_47","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"MH Liffiton","year":"2012","unstructured":"Liffiton, M.H., Maglalang, J.C.: A cardinality solver: more expressive constraints for free. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 485\u2013486. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31612-8_47"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-09284-3_22","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"A Biere","year":"2014","unstructured":"Biere, A., Le Berre, D., Lonca, E., Manthey, N.: Detecting cardinality constraints in CNF. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 285\u2013301. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09284-3_22"},{"key":"13_CR40","unstructured":"Roussel, O., Manquinho, V.M.: Pseudo-Boolean and cardinality constraints. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pp. 695\u2013733. IOS Press (2009)"},{"issue":"1\u20134","key":"13_CR41","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. JSAT 2(1\u20134), 1\u201326 (2006)","journal-title":"JSAT"},{"key":"13_CR42","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":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding pseudo-Boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04244-7_29"},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-33954-2_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"I Ab\u00edo","year":"2016","unstructured":"Ab\u00edo, I., Gange, G., Mayer-Eichberger, V., Stuckey, P.J.: On CNF encodings of decision diagrams. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 1\u201317. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33954-2_1"},{"issue":"8","key":"13_CR46","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-10575-8_7","volume-title":"Handbook of Model Checking","author":"RE Bryant","year":"2018","unstructured":"Bryant, R.E.: Binary decision diagrams. Handbook of Model Checking, pp. 191\u2013217. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10575-8_7"},{"key":"13_CR48","unstructured":"Gent, I.P.: Arc consistency in SAT. In: van Harmelen, F. (ed.) Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2002, Lyon, France, 2002 July 2002, pp. 121\u2013125. IOS Press (2002)"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC via unit propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 133\u2013147. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74970-7_12"},{"key":"13_CR50","unstructured":"Rodriguez-Tello, E., Romero-Monsivais, H., Ram\u00edrez-Torres, J., Lardeux, F.: Harwell-boeing graphs for the CB problem (2015). \nhttps:\/\/www.researchgate.net\/publication\/272022702_Harwell-Boeing_graphs_for_the_CB_problem"},{"key":"13_CR51","unstructured":"Biere, A.: CaDiCaL at the SAT Race 2019. In: Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019 - Solver and Benchmark Descriptions. Volume B-2019-1 of Department of Computer Science Series of Publications B, pp. 8\u20139. University of Helsinki (2019)"},{"key":"13_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-13520-0_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"PJ Stuckey","year":"2010","unstructured":"Stuckey, P.J.: Lazy clause generation: combining the power of SAT and CP (and MIP?) solving. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 5\u20139. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13520-0_3"},{"key":"13_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"13_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cir\u00e9, A.A., van Hoeve, W., Hooker, J.N.: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42849-9"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:08:17Z","timestamp":1600409297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_13","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":"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)"}}]}}