{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:20:41Z","timestamp":1743142841960,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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_3","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"41-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Akg\u00fcn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s Z.","family":"Salamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Spracklen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Stone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-30048-7_1","volume-title":"Principles and Practice of Constraint Programming","author":"\u00d6 Akg\u00fcn","year":"2019","unstructured":"Akg\u00fcn, \u00d6., Dang, N., Miguel, I., Salamon, A.Z., Stone, C.: Instance generation via generator instances. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 3\u201319. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-30048-7_1"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Akgun, O., et al.: Automated symmetry breaking and model selection in Conjure. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 107\u2013116. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40627-0_11","DOI":"10.1007\/978-3-642-40627-0_11"},{"key":"3_CR3","unstructured":"Akg\u00fcn, \u00d6., Miguel, I., Jefferson, C., Frisch, A.M., Hnich, B.: Extensible automated constraint modelling. In: AAAI 2011: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, pp. 4\u201311. AAAI Press (2011). \nhttps:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI11\/paper\/viewPaper\/3687"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Alissa, M., Sim, K., Hart, E.: Algorithm selection using deep learning without feature extraction. In: GECCO 2019: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 198\u2013206. ACM (2019)","DOI":"10.1145\/3321707.3321845"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: An enhanced features extractor for a portfolio of constraint solvers. In: SAC 2014: Proceedings of the 29th Annual ACM Symposium on Applied Computing, pp. 1357\u20131359. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2554850.2555114\n\n. Code available from \nhttps:\/\/github.com\/CP-Unibo\/mzn2feat","DOI":"10.1145\/2554850.2555114"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-44953-1_4","volume-title":"Principles and Practice of Constraint Programming","author":"G Belov","year":"2016","unstructured":"Belov, G., Stuckey, P.J., Tack, G., Wallace, M.: Improved linearization of constraint programming models. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 49\u201365. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44953-1_4"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Chu, G., de\u00a0la Banda, M., Stuckey, P.: Exploiting subproblem dominance in constraint programming. Constraints 17(1), 1\u201338 (2012). \nhttps:\/\/doi.org\/10.1007\/s10601-011-9112-9\n\n. Code available from \nhttps:\/\/github.com\/chuffed\/chuffed","DOI":"10.1007\/s10601-011-9112-9"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959). \nhttps:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag. Sci."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0377-2217(99)00205-2","volume":"125","author":"A Drexl","year":"2000","unstructured":"Drexl, A., Nissen, R., Patterson, J.H., Salewski, F.: Progen\/$$\\pi $$x-an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125(1), 59\u201372 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints 13(3), 268\u2013306 (2008). \nhttps:\/\/doi.org\/10.1007\/s10601-008-9047-y","journal-title":"Constraints"},{"key":"3_CR11","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: a fast scalable constraint solver. In: Proceedings of ECAI 2006, pp. 98\u2013102. IOS Press (2006). \nhttp:\/\/ebooks.iospress.nl\/volumearticle\/2658"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"IP Gent","year":"1999","unstructured":"Gent, I.P., Walsh, T.: CSPlib: a benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480\u2013481. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-540-48085-3_36\n\n. \nhttp:\/\/www.csplib.org"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"JN Hooker","year":"1995","unstructured":"Hooker, J.N.: Testing heuristics: we have it all wrong. J. Heuristics 1(1), 33\u201342 (1995)","journal-title":"J. Heuristics"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-44973-4_16","volume-title":"Learning and Intelligent Optimization","author":"HH Hoos","year":"2013","unstructured":"Hoos, H.H., Kaufmann, B., Schaub, T., Schneider, M.: Robust benchmark set selection for boolean constraint solvers. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 138\u2013152. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-44973-4_16"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-63890-3_4","volume-title":"Algorithms and Computation","author":"S Horie","year":"1997","unstructured":"Horie, S., Watanabe, O.: Hard instance generation for SAT. In: Leong, H.W., Imai, H., Jain, S. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 22\u201331. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63890-3_4"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"3_CR17","unstructured":"IBM: IBM ILOG CPLEX Optimization Studio documentation (2019)"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Julstrom, B.A.: Evolving heuristically difficult instances of combinatorial problems. In: GECCO 2009: Proceedings of the 11th Annual conference on Genetic and Evolutionary Computation, pp. 279\u2013286. ACM (2009). \nhttps:\/\/doi.org\/10.1145\/1569901.1569941","DOI":"10.1145\/1569901.1569941"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-50137-6_7","volume-title":"Data Mining and Constraint Programming","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O\u2019Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS (LNAI), vol. 10101, pp. 149\u2013190. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50137-6_7"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992). \nhttps:\/\/doi.org\/10.1016\/0377-2217(92)90192-C","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"3_CR21","first-page":"1","volume":"18","author":"G Lema\u00eetre","year":"2017","unstructured":"Lema\u00eetre, G., Nogueira, F., Aridas, C.K.: Imbalanced-learn: a python toolbox to tackle the curse of imbalanced datasets in machine learning. J. Mach. Learn. Res. 18(17), 1\u20135 (2017). \nhttp:\/\/jmlr.org\/papers\/v18\/16-365.html","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). \nhttps:\/\/doi.org\/10.1016\/j.orp.2016.09.002\n\n. \nhttp:\/\/iridia.ulb.ac.be\/irace\/","journal-title":"Oper. Res. Perspect."},{"key":"3_CR23","unstructured":"Louppe, G., Wehenkel, L., Sutera, A., Geurts, P.: Understanding variable importances in forests of randomized trees. In: Advances in Neural Information Processing Systems, pp. 431\u2013439 (2013)"},{"key":"3_CR24","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":"3_CR25","doi-asserted-by":"crossref","unstructured":"Neumann, A., Gao, W., Wagner, M., Neumann, F.: Evolutionary diversity optimization using multi-objective indicators. In: GECCO 2019: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 837\u2013845. ACM (2019)","DOI":"10.1145\/3321707.3321796"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.artint.2017.07.001","volume":"251","author":"P Nightingale","year":"2017","unstructured":"Nightingale, P., Akg\u00fcn, \u00d6., Gent, I.P., Jefferson, C., Miguel, I., Spracklen, P.: Automatically improving constraint models in Savile Row. Artif. Intell. 251, 35\u201361 (2017). \nhttps:\/\/doi.org\/10.1016\/j.artint.2017.07.001","journal-title":"Artif. Intell."},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/mnsc.2.3.276","volume":"2","author":"A Orden","year":"1956","unstructured":"Orden, A.: The transhipment problem. Manag. Sci. 2(3), 276\u2013285 (1956). \nhttps:\/\/doi.org\/10.1287\/mnsc.2.3.276","journal-title":"Manag. Sci."},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR29","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87\u2013104 (2011). \nhttps:\/\/doi.org\/10.1007\/s10472-011-9230-5","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-25566-3_41","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., Lopes, L.: Generalising algorithm performance in instance space: a timetabling case study. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 524\u2013538. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25566-3_41"},{"issue":"5","key":"3_CR31","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"key":"3_CR32","unstructured":"Vanhoucke, M., Maenhout, B.: NSPLib-a nurse scheduling problem library: a tool to evaluate (meta-) heuristic procedures. In: Operational Research for Health Policy: Making Better Decisions, Proceedings of the 31st Annual Meeting of the Working Group on Operations Research Applied to Health Services, pp. 151\u2013165 (2007)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:04:58Z","timestamp":1600409098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_3","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)"}}]}}