0 Mėgstami
0Krepšelis

The Traveling Salesman Problem and Its Variations

508,18 
508,18 
2025-07-31 508.1800 InStock
Nemokamas pristatymas į paštomatus per 18-22 darbo dienų užsakymams nuo 19,00 

Knygos aprašymas

A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.

Informacija

Serija: Combinatorial Optimization
Leidėjas: Springer US
Išleidimo metai: 2002
Knygos puslapių skaičius: 852
ISBN-10: 1402006640
ISBN-13: 9781402006647
Formatas: Knyga kietu viršeliu
Kalba: Anglų
Žanras: Management decision making

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „The Traveling Salesman Problem and Its Variations“

Būtina įvertinti prekę

Goodreads reviews for „The Traveling Salesman Problem and Its Variations“