{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:47:23Z","timestamp":1743047243015,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":36,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_71","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:04:41Z","timestamp":1219662281000},"page":"391-394","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorial Test Problems and Problem Generators"],"prefix":"10.1007","author":[{"given":"Don","family":"Grundel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Jeffcoat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"71_CR1_71","first-page":"256","volume-title":"Proceedings of the 17th National Conference on Artifical Intelligence, Austin, USA, 31 July\u20132 Aug 2000","author":"D Achlioptas","year":"2000","unstructured":"Achlioptas D, Gomes C, Kautz H, Selman B (2000) Generating\nsatisfiable problem instances. In: Proceedings of the 17th National Conference on Artifical Intelligence, Austin, USA, 31 July\u20132 Aug 2000. AAAI Press, Menlo Park, USA, pp\u00a0256\u2013261"},{"key":"71_CR2_71","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"RS Barr","year":"1995","unstructured":"Barr RS, Golden BL, Kelly JP, Resende MGC, Stewart WR (1995) Designing and Reporting on Computational Experiments\nwith Heuristic Methods. Heuristics J 1:9\u201332","journal-title":"Heuristics J"},{"issue":"11","key":"71_CR3_71","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1038\/sj\/jors\/0411109","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic\nmail. J\u00a0Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"71_CR4_71","unstructured":"Beasley\u00a0JE, OR-Library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html. Accessed 7 Dec 2007"},{"key":"71_CR5_71","unstructured":"Burkard\nR, \u00c7ela E, Karisch S, Rendlqaplib F  A\u00a0Quadratic\nAssignment Problem Library.\nhttp:\/\/www.opt.math.tu-graz.ac.at\/qaplib\/. Accessed 7 Dec 2007"},{"key":"71_CR6_71","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(85)90037-X","volume":"12","author":"R Burkard","year":"1985","unstructured":"Burkard R, Fincke U (1985) Probabilistic asymptotic properties of\nsome combinatorial optimization problems. Discret Appl\nMath 12:21\u201329","journal-title":"Discret Appl Math"},{"key":"71_CR7_71","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01582148","volume":"61","author":"PH Calamai","year":"1993","unstructured":"Calamai PH, Vicente LN, J\u00fadice JJ (1993) A\u00a0new technique\nfor generating quadratic programming test problems.\nMath Program 61:215\u2013231","journal-title":"Math Program"},{"key":"71_CR8_71","unstructured":"Center for Discrete Mathematics & Theoretical Computer Science, Rutgers University, NJ.\nhttp:\/\/dimacs.rutgers.edu\/. Accessed 7 Dec 2007"},{"key":"71_CR9_71","unstructured":"Eisenbl\u00e4tter A, Koster A.\u00a0FAP web, A\u00a0website about\nFrequency Assignment Problems. http:\/\/fap.zib.de\/index.php. Accessed 7 Dec 2007"},{"key":"71_CR10_71","unstructured":"Fourer\nR, Lopes L, Martin K (2004) LPFML: A\u00a0W3C XML Schema for\nLinear Programming.\nhttp:\/\/www.optimization-online.org\/DB_HTML\/2004\/02\/817.html. Accessed 7 Dec 2007"},{"key":"71_CR11_71","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas CA, Pardalos PM, Adjiman CS, Esposito WR, G\u00fcm\u00fcs ZH, Harding ST, Klepeis JL,\nMeyer CA, Schweiger\u00a0CA (1999) Handbook of Test Problems in Local and Global Optimization.\nKluwer, Dordrecht, Netherlands"},{"key":"71_CR12_71","doi-asserted-by":"crossref","unstructured":"Grundel D, Pardalos P (2005) Test Problem Generator for the\nMultidimensional Assignment Problem. Comput Optim Appl 31(3)133\u2013146","DOI":"10.1007\/s10589-005-4558-6"},{"key":"71_CR13_71","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01096415","volume":"3","author":"J Hasselberg","year":"1993","unstructured":"Hasselberg J, Pardalos PM, Vairaktarakis G (1993) Test case\ngenerators and computational results for the maximum clique\nproblem. J\u00a0Glob Optim 3:463\u2013482","journal-title":"J Glob Optim"},{"key":"71_CR14_71","unstructured":"Homberger J Extended SOLOMON's VRPTW instances.\nhttp:\/\/www.fernuni-hagen.de\/WINF\/touren\/menuefrm\/probinst.htm. Accessed 7 Dec 2007"},{"key":"71_CR15_71","unstructured":"Hoos\nH, St\u00fctzle T (2000) SATLIB: An Online Resource for Research on SAT. In: Gent IP, v Maaren H, Walsh T (eds) SAT 2000. IOS Press, pp 283\u2013292. http:\/\/www.satlib.org\/. Accessed 7 Dec 2007"},{"key":"71_CR16_71","unstructured":"INFORMS\u00ae Online, \nOR\/Resource MS Collection: Resources: Problem Instances.\nhttp:\/\/www.informs.org\/Resources\/Resources\/Problem_Instances\/. Accessed 7 Dec 2007"},{"key":"71_CR17_71","doi-asserted-by":"crossref","unstructured":"Khoury BN, Paradalos PM, Du D\u2013Z (1993) A\u00a0Test Problem Generator\nfor the Steiner Problem in Graphs. Trans ACM Math Softw 19(4):509\u2013522","DOI":"10.1145\/168173.168420"},{"key":"71_CR18_71","unstructured":"Koch T, Martin A, Vo\u00df S SteinLib: An Updated Library\non Steiner Tree Problems in Graphs.\nhttp:\/\/elib.zib.de\/steinlib\/steinlib.php. Accessed 7 Dec 2007"},{"key":"71_CR19_71","unstructured":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (ZIB), a\u00a0non-university research institute of the state Berlin (1994\u20132002)\nhttp:\/\/elib.zib.de\/pub\/Packages\/mp-testdata\/index.html. Accessed 7 Dec 2007"},{"key":"#cr-split#-71_CR20_71.1","doi-asserted-by":"crossref","unstructured":"Krishnamurthy B (1987) Constructing test cases for partitioning heuristics. Trans IEEE Comput vol C-36,","DOI":"10.1109\/TC.1987.5009543"},{"key":"#cr-split#-71_CR20_71.2","unstructured":"Num. 9, September 1987, pp 1112-1114"},{"key":"71_CR21_71","doi-asserted-by":"crossref","unstructured":"Leyton-Brown K, Pearson M, Shoham Y (2000) Towards a\u00a0Universal\nTest Suite for Combinatorial Auction Algorithms. In: Proceedings of Conference ACM on Electronic Commerce, Minneapolis, USA, 17\u201320 Oct. Sponsored by Association for Computing Machinery (ACM) Special Interest Group on E-commerce. Test suite available via \nhttp:\/\/www.cs.ubc.ca\/~kevinlb\/CATS\/. Accessed 7 Dec 2007","DOI":"10.1145\/352871.352879"},{"key":"71_CR22_71","unstructured":"Mart\u00ed R. Linear Ordering: Publications and Working Papers.\nhttp:\/\/www.uv.es\/~rmarti\/paper\/lop.html. Accessed 7 Dec 2007"},{"key":"71_CR23_71","unstructured":"Moscato P Fractal Instances of the Traveling Salesman\nProblem. Densis, FEEC, Universidade UNICAMP Estadual de\nCampinas.\nhttp:\/\/www.ing.unlp.edu.ar\/cetad\/mos\/FRACTAL_TSP_home.html. Accessed 7 Dec 2007"},{"key":"71_CR24_71","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1008303023616","volume":"15","author":"G Palubeckis","year":"1999","unstructured":"Palubeckis G (1999) Generating hard test instances with known optimal\nsolution for the rectilinear quadratic assignment problem. J\u00a0Glob Optim 15:127\u2013156","journal-title":"J Glob Optim"},{"issue":"1","key":"71_CR25_71","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/103147.103156","volume":"17","author":"P Pardalos","year":"1991","unstructured":"Pardalos P (1991) Construction of test problems in quadratic bivalent\nprogramming. Trans ACM Math Softw 17(1):74\u201387, March 1991","journal-title":"Trans ACM Math Softw"},{"key":"71_CR26_71","first-page":"1","volume-title":"Nonlinear Assignment Problems. Algorithms and Applications","year":"2000","unstructured":"Pardalos P, Pitsoulis L (eds) (2000) Nonlinear Assignment\nProblems. Algorithms and Applications. Kluwer, Dordrecht, pp\u00a01\u201312"},{"key":"71_CR27_71","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1002\/1520-6750(199210)39:6<839::AID-NAV3220390609>3.0.CO;2-C","volume":"39","author":"M Pilcher","year":"1992","unstructured":"Pilcher M, Rardin R (1992) Partial polyhedral description and\ngeneration of discrete optimization problems with known optima.\nNav Res Logist 39:839\u2013858","journal-title":"Nav Res Logist"},{"key":"71_CR28_71","doi-asserted-by":"crossref","unstructured":"Reilly CH (1999) Input models for synthetic optimization problems. In: Farrington PA, Nembhard HB, Sturrock DT, Evans GW (eds) \nProceedings of the 1999 Winter Simulation Conference, Phoenix, USA","DOI":"10.1145\/324138.324175"},{"key":"71_CR29_71","unstructured":"Reinelt G Linear Ordering Library (LOLIB).\nhttp:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/LOLIB\/. Accessed 7 Dec 2007"},{"key":"71_CR30_71","unstructured":"Reinelt G. TSLIB. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/. Accessed 7 Dec 2007"},{"key":"71_CR31_71","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","volume":"58","author":"L Sanchis","year":"1995","unstructured":"Sanchis L (1995) Generating hard and diverse test sets for\nNP-hard graph problems. Discret Appl\nMath 58:35\u201366","journal-title":"Discret Appl Math"},{"issue":"2","key":"71_CR32_71","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1287\/ijoc.8.2.87","volume":"8","author":"L Sanchis","year":"1996","unstructured":"Sanchis L, Jagota A (1996) Some experimental and theoretical\nresults on test case generators for the maximum clique problem.\nINFORMS J Comput 8(2):87\u2013102","journal-title":"INFORMS J Comput"},{"key":"71_CR33_71","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","volume":"81","author":"B Selman","year":"1996","unstructured":"Selman B, Mitchell D, Levesque H (1996) Generating Hard\nSatisfiability Problems. Artif Intell 81:17\u201329","journal-title":"Artif Intell"},{"key":"71_CR34_71","unstructured":"Uchida T, Motoki M, Watanabe O Instance SAT Generation\nPage, Watanabe research group of Dept. of Math. and Computing\nSciences, Tokyo Inst. of Technology.\nhttp:\/\/www.is.titech.ac.jp\/~watanabe\/gensat\/index.html. Accessed 7 Dec 2007"},{"issue":"2","key":"71_CR35_71","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"L Yong","year":"1992","unstructured":"Yong L, Pardalos PM (1992) Generating quadratic\nassignment test problems with known optimal permutations.\nComput Optim Appl 1(2):163\u2013184","journal-title":"Comput Optim Appl"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:51:25Z","timestamp":1720695085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_71","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}