{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T18:22:12Z","timestamp":1746642132870,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503486"},{"type":"electronic","value":"9783319503493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_9","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T07:12:11Z","timestamp":1480489931000},"page":"123-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Structure-Preserving Instance Generation"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Malitsky","sequence":"first","affiliation":[]},{"given":"Marius","family":"Merschformann","sequence":"additional","affiliation":[]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-540-85958-1_42","volume-title":"Principles and Practice of Constraint Programming","author":"C Ans\u00f3tegui","year":"2008","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e0ndez, C., Mateu, C.: Edge matching puzzles as hard SAT\/CSP benchmarks. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 560\u2013565. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85958-1_42"},{"key":"9_CR2","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J., Li, C.M.: Analysis and generation of pseudo-industrial maxsat instances. In: CCIA. FAIA, vol. 248, pp. 173\u2013184. IOS Press (2012)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-31612-8_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"C Ans\u00f3tegui","year":"2012","unstructured":"Ans\u00f3tegui, C., Gir\u00e1ldez-Cru, J., Levy, J.: The community structure of SAT formulas. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 410\u2013423. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31612-8_31"},{"key":"9_CR4","first-page":"11","volume-title":"CCIA. FAIA","author":"C Ans\u00f3tegui","year":"2011","unstructured":"Ans\u00f3tegui, C., Levy, J.: On the modularity of industrial sat instances. In: Fern\u00e1ndez, C., Geffner, H., Many\u00e0, F. (eds.) CCIA. FAIA, vol. 232, pp. 11\u201320. IOS Press, Amsterdam (2011)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_14"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Ansotegui, C., Malitsky, Y., Sellmann, M.: MaxSAT by improved instance-specific algorithm configuration. In: AAAI (2014)","DOI":"10.1007\/978-3-319-11230-5"},{"key":"9_CR7","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: Eighth Max-SAT evaluation (2013)"},{"key":"#cr-split#-9_CR8.1","unstructured":"Balint, A., Belov, A., Heule, M., J\u00e4rvisalo, M.: Proceedings of SAT competition 2013"},{"key":"#cr-split#-9_CR8.2","unstructured":"solver and benchmark descriptions. Technical report, University of Helsinki (2013)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11754602_12","volume-title":"Recent Advances in Constraints","author":"R Bart\u00e1k","year":"2006","unstructured":"Bart\u00e1k, R.: On generators of random quasigroup problems. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol. 3978, pp. 164\u2013178. Springer, Heidelberg (2006). doi: 10.1007\/11754602_12"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: AAAI Conference on Weblogs and Social Media (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-09584-4_6","volume-title":"Learning and Intelligent Optimization","author":"S Bayless","year":"2014","unstructured":"Bayless, S., Tompkins, D.A.D., Hoos, H.H.: Evaluating instance generators by configuration. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 2014. LNCS, vol. 8426, pp. 47\u201361. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-09584-4_6"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bejar, R., Cabiscol, A., Manya, F., Planes, J.: Generating hard instances for MaxSAT. In: International Symposium on Multiple-Valued Logic (ISMVL 2009), pp. 191\u2013195, May 2009","DOI":"10.1109\/ISMVL.2009.58"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-31612-8_40","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"S Burg","year":"2012","unstructured":"Burg, S., Kottler, S., Kaufmann, M.: Creating industrial-like SAT instances by clustering and reconstruction. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 471\u2013472. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31612-8_40"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Dinur, I., Goldwasser, S., Lin, H.: The computational benefit of correlated instances. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. pp. 219\u2013228. ACM (2015)","DOI":"10.1145\/2688073.2688082"},{"key":"9_CR15","unstructured":"Gent, I.P., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: combining structure and randomness. In: Hendler, J., Subramanian, D. (eds.) AAAI, pp. 654\u2013660 (1999)"},{"key":"9_CR16","unstructured":"Gomes, C.P., Selman, B.: Problem structure in the presence of perturbations. In: Kuipers, B., Webber, B.L. (eds.) AAAI, pp. 221\u2013226 (1997)"},{"key":"9_CR17","unstructured":"Hamerly, G., Elkan, C.: Learning the k in k-means. In: Neural Information Processing Systems (NIPS) (2003)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25566-3_40"},{"key":"9_CR19","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance-specific algorithm configuration. In: ECAI. FAIA, vol. 215, pp. 751\u2013756. IOS Press (2010)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-33558-7_27","volume-title":"CP 2012","author":"G Katsirelos","year":"2012","unstructured":"Katsirelos, G., Simon, L.: Eigenvector centrality in industrial sat instances. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 348\u2013356. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33558-7_27"},{"issue":"23","key":"9_CR21","doi-asserted-by":"publisher","first-page":"238701","DOI":"10.1103\/PhysRevLett.102.238701","volume":"102","author":"F Krzakala","year":"2009","unstructured":"Krzakala, F., Zdeborov\u00e1, L.: Hiding quiet solutions in random constraint satisfaction problems. Phys. Rev. Lett. 102(23), 238701 (2009)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.2013.1169","volume":"61","author":"L Lopes","year":"2013","unstructured":"Lopes, L., Smith-Miles, K.: Generating applicable synthetic instances for branch problems. Oper. Res. 61(3), 563\u2013577 (2013)","journal-title":"Oper. Res."},{"key":"9_CR23","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI (2013)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/11564751_65","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"M Motoki","year":"2005","unstructured":"Motoki, M.: Test instance generation for MAX 2SAT. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 787\u2013791. Springer, Heidelberg (2005). doi: 10.1007\/11564751_65"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-10762-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Nallaperuma","year":"2014","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN XIII 2014. LNCS, vol. 8672, pp. 100\u2013109. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-10762-2_10"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random SAT: beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438\u2013452. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30201-8_33"},{"key":"9_CR27","unstructured":"Pari, P.R., Lin, J., Yuan, L., Qu, G.: Generating \u2018random\u2019 3-SAT instances with specific solution space structure. In: McGuinness, D.L., Ferguson, G. (eds.) AAAI, pp. 960\u2013961 (2004)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). doi: 10.1007\/3-540-49481-2_30"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/3-540-36187-1_52","volume-title":"AI 2002: Advances in Artificial Intelligence","author":"A Slater","year":"2002","unstructured":"Slater, A.: Modelling more realistic SAT problems. In: McKay, B., Slaney, J. (eds.) AI 2002. LNCS (LNAI), vol. 2557, pp. 591\u2013602. Springer, Heidelberg (2002). doi: 10.1007\/3-540-36187-1_52"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles, K., Bowly, S.: Generating new test instances by evolving in instance space. Comput. Oper. Res. 63, 102\u2013113 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9_CR31","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)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-14186-7_37","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A Gelder Van","year":"2010","unstructured":"Van Gelder, A., Spence, I.: Zero-one designs produce small hard SAT instances. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 388\u2013397. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14186-7_37"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T03:38:31Z","timestamp":1692589111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion10.unina.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}