Abstract
We’ve seen a slew of techniques that manipulate complete solutions. Let’s now consider some of the algorithms that work with partial or incomplete solutions and solve problems by constructing solutions one piece at a time. We begin with the best-known category: greedy algorithms.
Two and two make four Four and four make eight Eight and eight make sixteen Repeat! says the teacher.
Jacques Prévert, Page d’écriture
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z., Fogel, D.B. (2004). Traditional Methods — Part 2. In: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07807-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-07807-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-06134-9
Online ISBN: 978-3-662-07807-5
eBook Packages: Springer Book Archive