{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:55Z","timestamp":1750221235364,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T00:00:00Z","timestamp":1530835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673359,61150110488,71520107002"],"award-info":[{"award-number":["61673359,61150110488,71520107002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,6]]},"DOI":"10.1145\/3205651.3208284","type":"proceedings-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T19:30:44Z","timestamp":1530905444000},"page":"1761-1768","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A generic problem instance generator for discrete optimization problems"],"prefix":"10.1145","author":[{"given":"Markus","family":"Ullrich","sequence":"first","affiliation":[{"name":"University of Applied Sciences, G\u00f6rlitz, Saxony, Germany"}]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[{"name":"Hefei University, Hefei, Anhui, China"}]},{"given":"Abhishek","family":"Awasthi","sequence":"additional","affiliation":[{"name":"University of Applied Sciences, G\u00f6rlitz, Saxony, Germany"}]},{"given":"J\u00f6rg","family":"L\u00e4ssig","sequence":"additional","affiliation":[{"name":"University of Applied Sciences, G\u00f6rlitz, Saxony, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate David Lee","key":"e_1_3_2_1_1_1","unstructured":"David Lee Applegate , Robert E. Bixby , Va\u0161ek Chv\u00e1tal , and William John Cook . 2007. The Traveling Salesman Problem: A Computational Study . Princeton University Press , Princeton, NJ, USA . David Lee Applegate, Robert E. Bixby, Va\u0161ek Chv\u00e1tal, and William John Cook. 2007. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ, USA."},{"volume-title":"Combinatorial Optimization","author":"Cook William J.","key":"e_1_3_2_1_2_1","unstructured":"William J. Cook , William H. Cunningham , William R. Pulleyblank , and Alexander Schrijver . 1997. Combinatorial Optimization . Wiley Interscience , Chichester, West Sussex, UK. William J. Cook, William H. Cunningham, William R. Pulleyblank, and Alexander Schrijver. 1997. Combinatorial Optimization. Wiley Interscience, Chichester, West Sussex, UK."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00205-2"},{"key":"e_1_3_2_1_4_1","volume-title":"Combinatorial Optimization","volume":"12","author":"Gregory","unstructured":"Gregory Z. Gutin and Abraham P. Punnen (Eds.). 2002. The Traveling Salesman Problem and its Variations . Combinatorial Optimization , Vol. 12 . Kluwer Academic Publishers, Berlin, Heidelberg Gregory Z. Gutin and Abraham P. Punnen (Eds.). 2002. The Traveling Salesman Problem and its Variations. Combinatorial Optimization, Vol. 12. Kluwer Academic Publishers, Berlin, Heidelberg"},{"volume-title":"Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS). 23--30","author":"Heinz S.","key":"e_1_3_2_1_5_1","unstructured":"S. Heinz and J.C. Beck . 2011. Solving resource allocation\/scheduling problems with constraint integer programming . In Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS). 23--30 . S. Heinz and J.C. Beck. 2011. Solving resource allocation\/scheduling problems with constraint integer programming. In Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS). 23--30."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2433680"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369025"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.41.10.1693"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0539-8"},{"key":"e_1_3_2_1_10_1","volume-title":"A Generator of Nonregular Semi-definite Programming Problems","author":"Macedo Elo\u00edsa","year":"1825","unstructured":"Elo\u00edsa Macedo and Tatiana Tchemisova . 2017. A Generator of Nonregular Semi-definite Programming Problems . In Springer Proceedings in Mathematics and Statistics, Springer (Ed .). http:\/\/hdl.handle.net\/10773\/ 1825 2 Elo\u00edsa Macedo and Tatiana Tchemisova. 2017. A Generator of Nonregular Semi-definite Programming Problems. In Springer Proceedings in Mathematics and Statistics, Springer (Ed.). http:\/\/hdl.handle.net\/10773\/18252"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1006063"},{"key":"e_1_3_2_1_12_1","volume-title":"Pardalos and Ding-Zhu Du (Eds.)","author":"Panos","year":"1990","unstructured":"Panos M. Pardalos and Ding-Zhu Du (Eds.) . 1990 . Handbook of Combinatorial Optimization. Vol. 1-- 3 . Kluwer Academic Publishers , Norwell, MA, USA. Panos M. Pardalos and Ding-Zhu Du (Eds.). 1990. Handbook of Combinatorial Optimization. Vol. 1--3. Kluwer Academic Publishers, Norwell, MA, USA."},{"key":"e_1_3_2_1_13_1","volume-title":"Pilcher","author":"Rardin Ronald L.","year":"2011","unstructured":"Ronald L. Rardin , Craig A. Tovey , and Martha G . Pilcher . 2011 . Analysis of a Random Cut Test Instance Generator for the TSP. WORLD SCIENTIFIC , 387--405. Ronald L. Rardin, Craig A. Tovey, and Martha G. Pilcher. 2011. Analysis of a Random Cut Test Instance Generator for the TSP. WORLD SCIENTIFIC, 387--405."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2363479"},{"volume-title":"Proceedings of Association for the Advancement of Artificial Intelligence (AAAI). 544--549","author":"Smith T.B.","key":"e_1_3_2_1_16_1","unstructured":"T.B. Smith and M.P. John . 2004. An effective algorithm for project scheduling with arbitrary temporal constraints .. In Proceedings of Association for the Advancement of Artificial Intelligence (AAAI). 544--549 . T.B. Smith and M.P. John. 2004. An effective algorithm for project scheduling with arbitrary temporal constraints.. In Proceedings of Association for the Advancement of Artificial Intelligence (AAAI). 544--549."},{"key":"e_1_3_2_1_17_1","unstructured":"Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application. it-weise.de (self-published) Germany http:\/\/www.it-weise.de\/projects\/book.pdf  Thomas Weise. 2009. Global Optimization Algorithms - Theory and Application. it-weise.de (self-published) Germany http:\/\/www.it-weise.de\/projects\/book.pdf"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1274-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389252"},{"volume-title":"Raymond Chiong (Ed.). Studies in Computational Intelligence","author":"Weise Thomas","key":"e_1_3_2_1_21_1","unstructured":"Thomas Weise , Michael Zapf , Raymond Chiong , and Antonio Jes\u00fas Nebro Urbaneja . 2009. Why is optimization difficult? In Nature-Inspired Algorithms for Optimisation , Raymond Chiong (Ed.). Studies in Computational Intelligence , Vol. 193 . Springer-Verlag , Berlin\/ Heidelberg, Chapter 1, 1--50. Thomas Weise, Michael Zapf, Raymond Chiong, and Antonio Jes\u00fas Nebro Urbaneja. 2009. Why is optimization difficult? In Nature-Inspired Algorithms for Optimisation, Raymond Chiong (Ed.). Studies in Computational Intelligence, Vol. 193. Springer-Verlag, Berlin\/Heidelberg, Chapter 1, 1--50."}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Kyoto Japan","acronym":"GECCO '18"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3208284","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205651.3208284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:14Z","timestamp":1750212434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3208284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,6]]},"references-count":21,"alternative-id":["10.1145\/3205651.3208284","10.1145\/3205651"],"URL":"https:\/\/doi.org\/10.1145\/3205651.3208284","relation":{},"subject":[],"published":{"date-parts":[[2018,7,6]]},"assertion":[{"value":"2018-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}