| |
The travelling salesman problem
(TSP) is an NP-hard problem in combinatorial
optimization studied in operations research and
theoretical computer science.
The problem was first formulated as a
mathematical problem in 1930 and is one of the
most intensively studied problems in
optimization. It is used as a benchmark for many
optimization methods.
Even though the problem is computationally
difficult,[1] a large number of heuristics and
exact methods are known, so that some instances
with tens of thousands of cities can be
solved.Referenca na
ovaj dokumentt!
 |
|
