Nearest neighbor algorithm

From Glossary

Jump to: navigation, search

A type of greedy algorithm for combinatorial programs where there is measure of nearness between neighbors. An example is the traveling salesman problem, where the procedure is to choose the next city to be one that is nearest the current city in the sequence.

Personal tools