{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:01:47Z","timestamp":1725519707669},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886358"},{"type":"electronic","value":"9783540886365"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88636-5_39","type":"book-chapter","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T02:19:04Z","timestamp":1224209944000},"page":"407-417","source":"Crossref","is-referenced-by-count":5,"title":["Using Hyper-heuristics for the Dynamic Variable Ordering in Binary Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 C.","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Valenzuela-Rend\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055923","volume-title":"Genetic programming: An Introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic programming: An Introduction. Morgan Kaufmann Publishers, Inc., London (1998)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Brelaz, D.: New methods to colour the vertices of a graph. Comunications of the ACM\u00a022 (1979)","DOI":"10.1145\/359094.359101"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics","author":"E. Burke","year":"2003","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern research technolology. In: Handbook of Metaheuristics, pp. 457\u2013474. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"39_CR4","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the real hard problems are. In: Proceedings of IJCAI 1991, pp. 331\u2013337 (1991)"},{"issue":"5","key":"39_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TEVC.2003.816584","volume":"7","author":"B.G.W. Craenen","year":"2003","unstructured":"Craenen, B.G.W., Eiben, A.E., van Hemert, J.I.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation\u00a07(5), 424\u2013444 (2003)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"38","author":"R. Dechter","year":"1994","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence\u00a038(2), 211\u2013242 (1994)","journal-title":"Artificial Intelligence"},{"key":"39_CR7","volume-title":"Artificial Intelligence through Simulated Evolution","author":"D.B. Fogel","year":"1966","unstructured":"Fogel, D.B., Owens, L.A., Walsh, M.: Artificial Intelligence through Simulated Evolution. Wiley, New York (1966)"},{"key":"39_CR8","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-61551-2_74","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"I.P. Gent","year":"1996","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 179\u2013193. Springer, Heidelberg (1996)"},{"key":"39_CR10","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)"},{"key":"39_CR11","unstructured":"Goldberg, D., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, 93\u2013130 (1989)"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/05695557608975076","volume":"8","author":"B.L. Golden","year":"1976","unstructured":"Golden, B.L.: Approaches to the cutting stock problem. AIIE Transactions\u00a08, 256\u2013274 (1976)","journal-title":"AIIE Transactions"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"39_CR14","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Marchiori, E., Steenbeek, A.: A genetic local search algorithm for random binary constraint satisfaction problems. In: Proceedings of the 2000 ACM symposium on Applied computing, Como, Italy, vol.\u00a01, pp. 458\u2013462 (2000)","DOI":"10.1145\/335603.335910"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Phillips, A., Laird, P.: Minimizing conflicts: A heuristic repair method for csp and scheduling problems. Artificial Intellgence\u00a058, 161\u2013205 (1992)","journal-title":"Artificial Intellgence"},{"key":"39_CR17","unstructured":"Minton, S., Phillips, A., Laird, P.: Solving large-scale csp and scheduling problems using a heuristic repair method. In: Proceedings of the 8th AAAI Conference, pp. 17\u201324 (1990)"},{"key":"39_CR18","unstructured":"Prosser, P.: Binary constraint satisfaction problems: Some are harder than others. In: Proceedings of the European Conference in Artificial Intelligence, Amsterdam, Holland, pp. 95\u201399 (1994)"},{"key":"39_CR19","volume-title":"Evolutionstrategie: Optimierung technischer systeme nach prinzipien dier biolischen evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung technischer systeme nach prinzipien dier biolischen evolution. Frommann-Holzboog, Stuttgart (1973)"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Ross, P., Bl\u00e1zquez, J.M., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Proceedings of GECCO 2003, pp. 1295\u20131306 (2003)","DOI":"10.1007\/3-540-45110-2_5"},{"key":"39_CR21","volume-title":"Artificial Intelligence A Modern Approach","author":"S. Russell","year":"1995","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence A Modern Approach. Prentice Hall, Englewood Cliffs (1995)"},{"key":"39_CR22","volume-title":"Numerical Optimization of Computer Models","author":"H.P. Schwefel","year":"1981","unstructured":"Schwefel, H.P.: Numerical Optimization of Computer Models. Wiley, Chichester (1981)"},{"key":"39_CR23","first-page":"35","volume":"16","author":"H. Terashima-Mar\u00edn","year":"2005","unstructured":"Terashima-Mar\u00edn, H., Calleja-Manzanedo, R., Valenzuela-Rend\u00f3n, M.: Genetic Algorithms for Dynamic Variable Ordering in Constraint Satisfaction Problems. Advances in Artificial Intelligence Theory\u00a016, 35\u201344 (2005)","journal-title":"Advances in Artificial Intelligence Theory"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn, H., Far\u00edas-Z\u00e1rate, C.J., Ross, P., Valenzuela-Rend\u00f3n, M.: A GA-Based Method to Produce Generalized Hyper-heuristics for the 2D-Regular Cutting Stock Problem. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation, Seattle, Washington, USA, pp. 591\u2013598 (2006)","DOI":"10.1145\/1143997.1144102"},{"key":"39_CR25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4660.001.0001","volume-title":"The MIT Encyclopedia of the Cognitive Science","author":"R.A. Wilson","year":"1999","unstructured":"Wilson, R.A., Keil, F.C.: The MIT Encyclopedia of the Cognitive Science. MIT Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2008: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88636-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T14:38:41Z","timestamp":1684593521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88636-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886358","9783540886365"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88636-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}