Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Travelling Salesman Problem
CHF 37.45
Auf Lager
SKU
79R74VBTM7H
1 Verfügbar 
Geliefert zwischen Mo., 19.01.2026 und Di., 20.01.2026
Details
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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130314705
- Genre Technik
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Anzahl Seiten 72
- Größe H4mm x B220mm x T150mm
- Jahr 2009
- EAN 9786130314705
- Format Kartonierter Einband
- ISBN 978-613-0-31470-5
- Titel Travelling Salesman Problem
- Untertitel Combinatorial Optimization, Operations Research, Theoretical Computer Science, Computational Complexity Theory, Canadian Traveller Problem, Vehicle Routing Problem
- Gewicht 114g
- Herausgeber Betascript Publishers
Bewertungen
Schreiben Sie eine Bewertung
