Greedy algorithm - Wikipedia, the free encyclopedia

Greedy algorithm - Wikipedia, the free encyclopedia -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Greedy algorithm - Wikipedia, the free encyclopedia 1 of 2 12/13/2006 1:45 PM Greedy algorithm From Wikipedia, the free encyclopedia A greedy algorithm is an algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage with the hope of finding the global optimum. For instance, applying the greedy strategy to the traveling salesman problem yields the following algorithm: "At each stage visit the unvisited city nearest to the current city". A candidate set, from which a solution is created 1. A selection function, which chooses the best candidate to be added to the solution 2. A feasibility function, that is used to determine if a candidate can be used to contribute to a solution 3. An objective function, which assigns a value to a solution, or a partial solution, and 4. A solution function, which will indicate when we have discovered a complete solution 5. There are two ingredients that are exhibited by most
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/25/2010 for the course CPE CPE 360 taught by Professor Jenniferchen during the Spring '10 term at Stevens.

Ask a homework question - tutors are online