{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:12Z","timestamp":1720640832655},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s1571-0653(05)80106-4","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"55-67","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem"],"prefix":"10.1016","volume":"4","author":[{"given":"Joachim","family":"Schimpf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80106-4_BIB1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00143877","article-title":"Automatically Configuring Constraint satisfaction Problems: A Case Study","volume":"1","author":"Minton","year":"1996","journal-title":"Constraints"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB2","doi-asserted-by":"crossref","unstructured":"Y. Caseau, F. Laburthe and G. Silverstein, A Meta-Heuristic Factory for Vehicle Routing Problems, in Proc. CPJ99 (Washington DC, 1999).","DOI":"10.1007\/978-3-540-48085-3_11"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB3","doi-asserted-by":"crossref","unstructured":"Y. Caseau, F. Laburthe, SALSA: A Language for Search Algorithms, in Proc. CP'98 (Pisa, 1998) 310-324.","DOI":"10.1007\/3-540-49481-2_23"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB4","series-title":"The OPL Optimization Programming Language","author":"Van Hentenryck","year":"1999"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB5","doi-asserted-by":"crossref","unstructured":"H. El Sakkout, M. Wallace and E. Richards, An Instance of Adaptive Propagation, in Proc. CP'96 (Boston, 1996).","DOI":"10.1007\/3-540-61551-2_73"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB6","doi-asserted-by":"crossref","unstructured":"R. Rodosek and M. Wallace, A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems, in Proc. CP'98 (Pisa, 1998).","DOI":"10.1007\/3-540-49481-2_28"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB7","doi-asserted-by":"crossref","unstructured":"E.T. Richards and E.B. Richards, Non-systematic Search and Learning: An Empirical Study, in Proc. CP'98 (Pisa, 1998).","DOI":"10.1007\/3-540-49481-2_27"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB8","unstructured":"J. Schimpf, K. Shen and M. Wallace, Tutorial on Search in ECLiPSe, www.icparc.ic.ac.uk\/eclipse Manuals and other documentation, 1999."},{"key":"10.1016\/S1571-0653(05)80106-4_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB10","doi-asserted-by":"crossref","unstructured":"L. Michel and P. Van Hentenryck, Localizer a Modelling Language for Local Search in Proc. CP'97 (Linz, 1997).","DOI":"10.1007\/BFb0017443"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB11","unstructured":"B. Selman and H. Kautz, An Empirical Study of Greedy Local Search for Satisfiability Testing, in AAAI-93, (1993) 46-51."},{"key":"10.1016\/S1571-0653(05)80106-4_BIB12","unstructured":"H. El Sakkout and M. Wallace, Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling, Constraints. Special issue on constraint-directed reasoning issues arising from industrial scheduling problems (To Appear)."},{"key":"10.1016\/S1571-0653(05)80106-4_BIB13","unstructured":"A. van Gelder and Y. Tsuji, Instances from circuit fault analysis, http:\/\/aida.intellektik.informatik.tu-darmstadt.de\/~hoos\/SATLIB\/Benchmarks\/SAT\/DIMACS\/BF\/descr.html0"},{"key":"10.1016\/S1571-0653(05)80106-4_BIB14","unstructured":"Chu Min Li and Anbulagan, Look-ahead versus Look-back for Satisfiability Problems, in Proc. CP'97, (Linz, 1997)."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:17:59Z","timestamp":1586236679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":14,"alternative-id":["S1571065305801064"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80106-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}