{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:14:03Z","timestamp":1778249643826,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650782","type":"print"},{"value":"9783540496724","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056917","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:49:17Z","timestamp":1154306957000},"page":"755-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions"],"prefix":"10.1007","author":[{"given":"Jens","family":"Gottlieb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Voss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"74_CR1","first-page":"73","volume-title":"GAVaPS \u2014 a Genetic Algorithm with Varying Population Size","author":"J. Arabas","year":"1994","unstructured":"J. Arabas, Z. Michalewicz and J. Mulawka, GAVaPS \u2014 a Genetic Algorithm with Varying Population Size, In Proceedings of the 1st IEEE International Conference on Evolutionary Computation, 73\u201378, IEEE Service Center, Piscataway, NJ, 1994"},{"key":"74_CR2","doi-asserted-by":"crossref","unstructured":"T. B\u00e4ck, A. E. Eiben and M. E. Vink. A Superior Evolutionary Algorithm for 3-SAT. In Proceedings of the 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, Springer, 1998 (in press)","DOI":"10.1007\/BFb0040766"},{"key":"74_CR3","first-page":"124","volume-title":"Using Genetic Algorithms to Solve NP-Complete Problems","author":"K. A. De Jong","year":"1989","unstructured":"K. A. De Jong and W. M. Spears. Using Genetic Algorithms to Solve NP-Complete Problems. In J. D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms, 124\u2013132, Morgan Kaufmann Publishers, San Mateo, CA, 1989"},{"key":"74_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, Volume 7, 201\u2013215, 1960","journal-title":"Journal of the ACM"},{"key":"74_CR5","first-page":"81","volume-title":"Solving 3-SAT with Adaptive Genetic Algorithms","author":"A. E. Eiben","year":"1997","unstructured":"A. E. Eiben and J. K. van der Hauw. Solving 3-SAT with Adaptive Genetic Algorithms. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 81\u201386, IEEE Service Center, Piscataway, NJ, 1997"},{"key":"74_CR6","doi-asserted-by":"crossref","unstructured":"C. Fleurent and J. A. Ferland. Object-oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability. In D. S. Johnson and M. A. Trick (eds.), Cliques, Coloring and Satisfiability: 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 26, 619\u2013652, 1996","DOI":"10.1090\/dimacs\/026\/29"},{"key":"74_CR7","doi-asserted-by":"crossref","unstructured":"J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994","DOI":"10.1007\/978-94-011-7108-3_57"},{"key":"74_CR8","unstructured":"J. Frank. Weighting for Godot: Learning Heuristics for GSAT. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, 338\u2013343, 1996"},{"key":"74_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA, 1979"},{"key":"74_CR10","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"74_CR11","doi-asserted-by":"crossref","unstructured":"J. Gottlieb and N. Voss. Representations, Fitness Functions and Genetic Operators for the Satisfiability Problem. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science, Volume 1363, 55\u201368, Springer, 1998","DOI":"10.1007\/BFb0026590"},{"key":"74_CR12","first-page":"289","volume-title":"A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems","author":"J.-K. Hao","year":"1995","unstructured":"J.-K. Hao. A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems. In D. W. Pearson, N. C. Steele, and R. F. Albrecht (eds.), Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 289\u2013292, Springer, Wien, 1995"},{"key":"74_CR13","first-page":"65","volume-title":"Adaptation in Evolutionary Computation: a Survey","author":"R. Hinterding","year":"1997","unstructured":"R. Hinterding, Z. Michalewicz and A. E. Eiben. Adaptation in Evolutionary Computation: a Survey. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, 65\u201369, IEEE Service Center, Piscataway, 1997"},{"key":"74_CR14","unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 459\u2013465, 1992"},{"key":"74_CR15","first-page":"512","volume-title":"A Comparative Study of Genetic Search","author":"K. Park","year":"1995","unstructured":"K. Park. A Comparative Study of Genetic Search. In L. J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, 512\u2013519, Morgan Kaufmann, San Mateo, CA, 1995"},{"key":"74_CR16","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 440\u2013446, 1992"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:34:07Z","timestamp":1778247247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0056917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0056917","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"3 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}