Keywords
- Local Search
- Travel Salesman Problem
- Local Search Heuristic
- Conjunctive Normal Form Formula
- Genetic Programming System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Bader-El-Den, M., Poli, R. (2009). Evolving Effective Incremental Solvers for SAT with a Hyper-Heuristic Framework Based on Genetic Programming. In: Genetic Programming Theory and Practice VI. Genetic and Evolutionary Computation. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-87623-8_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-87623-8_11
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-87622-1
Online ISBN: 978-0-387-87623-8
eBook Packages: Computer ScienceComputer Science (R0)