{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:08Z","timestamp":1783749308749,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4557,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0004-3702(00)00081-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:57:34Z","timestamp":1027601854000},"page":"43-62","source":"Crossref","is-referenced-by-count":292,"title":["Algorithm portfolios"],"prefix":"10.1016","volume":"126","author":[{"given":"Carla P.","family":"Gomes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00081-3_BIB001","series-title":"Proc. 35th Symposium on the Found. of Comp. Sci.","first-page":"492","article-title":"Go with the winners algorithms","author":"Aldous","year":"1994"},{"issue":"4\u20135","key":"10.1016\/S0004-3702(00)00081-3_BIB002","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/BF01940879","article-title":"A method for obtaining randomized algorithms with small tail probabilities","volume":"16","author":"Alt","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB003","first-page":"23","article-title":"Completing partial latin squares","volume":"41","author":"Anderson","year":"1985","journal-title":"Mathematisk Fysiske Meddelelser"},{"issue":"4","key":"10.1016\/S0004-3702(00)00081-3_BIB004","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Brelaz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB005","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0097-3165(83)90031-6","article-title":"Embedding partial Steiner triple systems is NP-complete","volume":"35","author":"Colbourn","year":"1983","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB006","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"49","article-title":"An analysis of time-dependent planning","author":"Dean","year":"1988"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB007","series-title":"Latin Squares and their Applications","author":"Denes","year":"1974"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB008","series-title":"Proc. Symposium on Theoretical Aspects of Computer Science","first-page":"463","article-title":"Optimal parallelization of Las Vegas algorithms","volume":"775","author":"Ertel","year":"1994"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB009","series-title":"Proc. IJCAI-93, Chamb\u00e9ry, France","first-page":"52","article-title":"Automatic generation of some results in finite algebra","author":"Fujita","year":"1993"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB010","series-title":"Proc. 13th Conference on Uncertainty in Artificial Intelligence (UAI-97), Providence, RI","first-page":"190","article-title":"Algorithm portfolio design: Theory vs. practice","author":"Gomes","year":"1997"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB011","series-title":"Proc. AAAI-97, Providence, RI","first-page":"221","article-title":"Problem structure in the presence of perturbations","author":"Gomes","year":"1997"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB012","series-title":"Principles and Practice of Constraint Programming (CP'97), Linz, Austria","first-page":"121","article-title":"Heavy-tailed distributions in combinatorial search","author":"Gomes","year":"1997"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB013","series-title":"Proc. AAAI-98, Providence, RI","first-page":"431","article-title":"Boosting combinatorial search through randomization","author":"Gomes","year":"1998"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00081-3_BIB014","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","article-title":"Heavy-tailed phenomena in satisfiability and constraint satisfaction problems","volume":"24","author":"Gomes","year":"2000","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(00)00081-3_BIB015","series-title":"Proceedings of Flexible Computation, Technical Report, AAAI Fall Symposium","year":"1995"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB016","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","article-title":"An economics approach to hard computational problems","volume":"275","author":"Huberman","year":"1997","journal-title":"Science"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB017","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"318","article-title":"Unifying SAT-based and graph-based planning","author":"Kautz","year":"1999"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB018","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"526","article-title":"State-space planning by integer optimization","author":"Kautz","year":"1999"},{"issue":"6","key":"10.1016\/S0004-3702(00)00081-3_BIB019","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.4153\/CJM-1989-049-4","article-title":"The non-existence of finite projective planes of order 10","volume":"XLI","author":"Lam","year":"1994","journal-title":"Can. J. Math."},{"key":"10.1016\/S0004-3702(00)00081-3_BIB020","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","article-title":"Optimal speedup of Las Vegas algorithms","volume":"47","author":"Luby","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(00)00081-3_BIB021","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB022","series-title":"Proc. ILPS'95, Lisbon, Portugal","first-page":"513","article-title":"Beyond the black box: Constraints as objects","author":"Puget","year":"1995"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB023","series-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"1995"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB024","series-title":"Proc. Congress on Evolutionary Computation","first-page":"53","article-title":"Cooperative strategies for solving the bicriteria sparse multiple knapsack problem","author":"Salman","year":"1999"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00081-3_BIB025","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(95)00056-9","article-title":"Finite-size scaling of the computational cost of systematic search","volume":"81","author":"Selman","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB026","series-title":"Proc. DIMACS Challenge on Satisfiability Testing, Graph Coloring, and Cliques","year":"1996"},{"key":"10.1016\/S0004-3702(00)00081-3_BIB027","series-title":"Integer programming models in AI planning, Technical Report, Workshop on Planning as Combinatorial Search (held in conjunction with AIPS-98), Pittsburgh, PA","author":"Vossen","year":"1999"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T06:19:35Z","timestamp":1578809975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0004370200000813"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00081-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}