Greedy Search Algorithm

From GM-RKB
(Redirected from Greedy Search)
Jump to navigation Jump to search

A Greedy Search Algorithm is a heuristic iterative search algorithm that makes the locally optimal choices at each iteration.



References

2022a

2022b

  • (Wikipedia, 2022) ⇒ https://en.wikipedia.org/wiki/Greedy_algorithm Retrieved:2022-4-2.
    • A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.[1] In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.

      For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city." This heuristic does not intend to find the best solution, but it terminates in a reasonable number of steps; finding an optimal solution to such a complex problem typically requires unreasonably many steps. In mathematical optimization, greedy algorithms optimally solve combinatorial problems having the properties of matroids and give constant-factor approximations to optimization problems with the submodular structure.

  1. Black, Paul E. (2 February 2005). "greedy algorithm". Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology (NIST). Retrieved 17 August 2012

2017