{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:15Z","timestamp":1767337815178,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031041471"},{"type":"electronic","value":"9783031041488"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04148-8_12","type":"book-chapter","created":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:02:31Z","timestamp":1649008951000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["PUBO$$_i$$: A Tunable Benchmark with Variable Importance"],"prefix":"10.1007","author":[{"given":"Sara","family":"Tari","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Verel","sequence":"additional","affiliation":[]},{"given":"Mahmoud","family":"Omidvar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"unstructured":"Bartz-Beielstein, T., et al.: Benchmarking in optimization: Best practice and open issues. arXiv preprint arXiv:2007.03488 (2020)","key":"12_CR1"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Global Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"unstructured":"Carnell, R.: LHS: Latin hypercube samples, R package version 0.16 (2018)","key":"12_CR3"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2236-3","volume":"18","author":"P Date","year":"2019","unstructured":"Date, P., Patton, R., Schuman, C., Potok, T.: Efficiently embedding QUBO problems on adiabatic quantum computers. Quantum Inf. Process. 18(4), 1\u201331 (2019). https:\/\/doi.org\/10.1007\/s11128-019-2236-3","journal-title":"Quantum Inf. Process."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"106207","DOI":"10.1016\/j.asoc.2019.106027","volume":"88","author":"C Doerr","year":"2020","unstructured":"Doerr, C., Ye, F., Horesh, N., Wang, H., Shir, O.M., B\u00e4ck, T.: Benchmarking discrete optimization heuristics with IOH profiler. Appl. Soft Comput. 88, 106207 (2020)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00011425","volume":"90","author":"A Galluccio","year":"2001","unstructured":"Galluccio, A., Loebl, M., Vondr\u00e1k, J.: Optimization via enumeration: a new algorithm for the max cut problem. Math. Program. 90(2), 273\u2013290 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1504\/IJMHEUR.2011.041196","volume":"1","author":"F Glover","year":"2011","unstructured":"Glover, F., Hao, J.K., Kochenberger, G.: Polynomial unconstrained binary optimisation-part 1. Int. J. Metaheuristics 1(3), 232\u2013256 (2011)","journal-title":"Int. J. Metaheuristics"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"043303","DOI":"10.1103\/PhysRevE.97.043303","volume":"97","author":"F Hamze","year":"2018","unstructured":"Hamze, F., Jacob, D.C., Ochoa, A.J., Perera, D., Wang, W., Katzgraber, H.G.: From near to eternity: spin-glass planting, tiling puzzles, and constraint-satisfaction problems. Phys. Rev. E 97(4), 043303 (2018)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Hansen, N., Auger, A., Ros, R., Finck, S., Po\u0161\u00edk, P.: Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In: GECCO, pp. 1689\u20131696 (2010)","key":"12_CR9","DOI":"10.1145\/1830761.1830790"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: A platform for comparing continuous optimizers in a black-box setting. Optim. Methods Softw. 36(1), 114\u2013144 (2021)","journal-title":"Optim. Methods Softw."},{"doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, coloring, and satisfiability: second DIMACS implementation challenge, 11\u201313 October, 1993, vol. 26. Am. Math. Soc. (1996)","key":"12_CR11","DOI":"10.1090\/dimacs\/026"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"105869","DOI":"10.1016\/j.asoc.2019.105869","volume":"85","author":"F Lepr\u00eatre","year":"2019","unstructured":"Lepr\u00eatre, F., et al.: Fitness landscapes analysis and adaptive algorithms design for traffic lights optimization on SIALAC benchmark. Appl. Soft Comput. 85, 105869 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207(3), 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan, K.M., Engelbrecht, A.P.: A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf. Sci. 241, 148\u2013163 (2013)","journal-title":"Inf. Sci."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.3390\/a14020040","volume":"14","author":"KM Malan","year":"2021","unstructured":"Malan, K.M.: A survey of advances in landscape analysis for optimisation. Algorithms 14(2), 40 (2021)","journal-title":"Algorithms"},{"unstructured":"Perera, D., et al.: Chook-a comprehensive suite for generating binary optimization problems with planted solutions. arXiv preprint arXiv:2005.14344 (2020)","key":"12_CR16"},{"doi-asserted-by":"crossref","unstructured":"Sagawa, M., et al.: Learning variable importance to guide recombination. In: 2016 IEEE SSCI, pp. 1\u20137 (2016)","key":"12_CR17","DOI":"10.1109\/SSCI.2016.7850229"},{"doi-asserted-by":"crossref","unstructured":"Sagawa, M., et al.: Learning variable importance to guide recombination on many-objective optimization. In: 6th IIAI-AAI, pp. 874\u2013879. IEEE (2017)","key":"12_CR18","DOI":"10.1109\/IIAI-AAI.2017.158"},{"issue":"1344","key":"12_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1098\/rspb.1994.0040","volume":"255","author":"P Schuster","year":"1994","unstructured":"Schuster, P., Fontana, W., Stadler, P.F., Hofacker, I.L.: From sequences to shapes and back: a case study in RNA secondary structures. Proc. R. Soc. London. Ser. B. Biol. Sci. 255(1344), 279\u2013284 (1994)","journal-title":"Proc. R. Soc. London. Ser. B. Biol. Sci."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-78133-4_4","volume-title":"Artificial Evolution","author":"S Tari","year":"2018","unstructured":"Tari, S., Basseur, M., Go\u00ebffon, A.: Sampled walk and binary fitness landscapes exploration. In: Lutton, E., Legrand, P., Parrend, P., Monmarch\u00e9, N., Schoenauer, M. (eds.) EA 2017. LNCS, vol. 10764, pp. 47\u201357. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78133-4_4"},{"doi-asserted-by":"crossref","unstructured":"Tu\u0161ar, T., Brockhoff, D., Hansen, N.: Mixed-integer benchmark problems for single-and bi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 718\u2013726 (2019)","key":"12_CR22","DOI":"10.1145\/3321707.3321868"},{"unstructured":"Tu\u0161ar, T., Brockhoff, D., Hansen, N., Auger, A.: COCO: the bi-objective black box optimization benchmarking (bbob-biobj) test suite. ArXiv e-prints (2016)","key":"12_CR23"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-99259-4_15","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"S Verel","year":"2018","unstructured":"Verel, S., Derbel, B., Liefooghe, A., Aguirre, H., Tanaka, K.: A surrogate model based on Walsh decomposition for pseudo-Boolean functions. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 181\u2013193. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_15"},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.2307\/2387224","volume":"45","author":"JL Walsh","year":"1923","unstructured":"Walsh, J.L.: A closed set of normal orthogonal functions. Am. J. Math. 45(1), 5 (1923)","journal-title":"Am. J. Math."},{"issue":"5","key":"12_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybern. 63(5), 325\u2013336 (1990)","journal-title":"Biol. Cybern."},{"unstructured":"Wood, S.: MGCV: GAMs in R. Generalized Additive Mixed Models Using MGCV and LME4 (2012)","key":"12_CR27"},{"unstructured":"Wright, S.: The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In: Proceedings of the Sixth International Congress of Genetics, vol. 1, pp. 356\u2013366 (1932)","key":"12_CR28"},{"key":"12_CR29","series-title":"Statistics for Biology and Health","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-0-387-87458-6_3","volume-title":"Mixed effects models and extensions in ecology with R","author":"AF Zuur","year":"2009","unstructured":"Zuur, A.F., Ieno, E.N., Walker, N.J., Saveliev, A.A., Smith, G.M.: Things are not always linear; additive modelling. In: Mixed effects models and extensions in ecology with R. SBH, pp. 35\u201369. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-87458-6_3"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04148-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:06:35Z","timestamp":1649009195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04148-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031041471","9783031041488"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04148-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"28","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":"13","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":"46% - 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":"4","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}