Traditional Methods — Part 2

  • Zbigniew Michalewicz
  • David B. Fogel


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.


Short Path Search Space Dynamic Programming Greedy Algorithm Greedy Approach 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zbigniew Michalewicz
    • 1
  • David B. Fogel
    • 2
  1. 1.Department of Computer ScienceUniversity of North CarolinaCharlotteUSA
  2. 2.Natural Selection, Inc.La JollaUSA

Personalised recommendations