-
Anglický jazyk
Travelling Salesman Problem
Autor: Lambert M. Surhone
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... Viac o knihe
Na objednávku, dodanie 2-4 týždne
113.34 €
bežná cena: 119.30 €
O knihe
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.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130314705
Nemecký jazyk 
