20,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
10 °P sammeln
Andere Kunden interessierten sich auch für
![Electric Overhead Travelling Crane Model]( "Electric Overhead Travelling Crane Model")
Electric Overhead Travelling Crane Model33,99 €![Travelling-wave Amplifier Photodetectors (TAP detectors)]( "Travelling-wave Amplifier Photodetectors (TAP detectors)")
Travelling-wave Amplifier Photodetectors (TAP detectors)33,99 €![Year 2000 Problem]( "Year 2000 Problem")
Year 2000 Problem23,99 €![Quantitative Problem Solving Methods in the Airline Industry]( "Quantitative Problem Solving Methods in the Airline Industry")
Quantitative Problem Solving Methods in the Airline Industry100,99 €![The Min-Interference Frequency Assignment Problem]( "The Min-Interference Frequency Assignment Problem")
The Min-Interference Frequency Assignment Problem33,99 €![Research and Practice on the Theory of Inventive Problem Solving (TRIZ)]( "Research and Practice on the Theory of Inventive Problem Solving (TRIZ)")
Research and Practice on the Theory of Inventive Problem Solving (TRIZ)77,99 €![Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs]( "Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs")
Minimum Edge-Ranking Spanning Tree Problem of Series-Parallel Graphs33,99 €
High Quality Content by WIKIPEDIA articles! The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. 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, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.