Abstract
We can solve many problems to optimality using exhaustive search techniques, although the time complexity can be enormous. For certain applications, it may pay to spend extra time to be certain of the optimal solution. A good example occurs in testing a circuit or a program on all possible inputs. You can prove the correctness of the device by trying all possible inputs and verifying that they give the correct answer. Verifying correctness is a property to be proud of.However, claiming that it works correctly on all the inputs you tried is worth much less.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
E. Aarts and J. Korst. Simulated annealing and Boltzman machines: A stochastic approach to combinatorial optimization and neural computing. John Wiley and Sons, 1989.
E. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization. John Wiley and Sons, West Sussex, England, 1997.
R. Bradley and S. Skiena. Fabricating arrays of strings. In Proc. First Int. Conf. Computational Molecular Biology (RECOMB ’97), pages 57–66, 1997.
C.R. Coullard, A.B. Gamble, and P.C. Jones. Matching problems in selective assembly operations. Annals of Operations Research, 76:95–107, 1998.
M. Dorigo and T.Stutzle. Ant Colony Optimization. MIT Press, Cambridge MA, 2004.
Y. Deng and C. Yang. Waring’s problem for pyramidal numbers. Science in China (Series A), 37:377–383, 1994.
M. Fredman, D. Johnson, L. McGeoch, and G. Ostheimer. Data structures for traveling salesmen. In Proc. 4th 7th Symp. Discrete Algorithms (SODA), pages 145–154, 1993.
S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.
Z. Michalewicz and D. Fogel. How to Solve it: Modern Heuristics. Springer, Berlin, 2000.
G. Allen Pugh. Partitioning for selective assembly. Computers and Industrial Engineering, 11:175–179, 1986.
A. Robison, B. Hafner, and S. Skiena. Eight pieces cannot cover a chessboard. Computer Journal, 32:567–570, 1989.
S. Skiena and M. Revilla. Programming Challenges: The Programming Contest Training Manual. Springer-Verlag, 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Skiena, S.S. (2012). Combinatorial Search and Heuristic Methods. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-84800-070-4_7
Publisher Name: Springer, London
Print ISBN: 978-1-84800-069-8
Online ISBN: 978-1-84800-070-4
eBook Packages: Computer ScienceComputer Science (R0)