Wyprzedane, ale poszukiwane!
Więcej o książce
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.
Zakup książki
Combinatorial Optimization: The Traveling Salesman Problem and Its Variations, Gregory Gutin, Abraham P. Punnen
- Język
- Rok wydania
- 2007
- Oprawa
- (miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.
Metody płatności
Nikt jeszcze nie ocenił.
- Tytuł
- Combinatorial Optimization: The Traveling Salesman Problem and Its Variations
- Język
- angielski
- Autorzy
- Gregory Gutin, Abraham P. Punnen
- Wydawca
- Springer
- Rok wydania
- 2007
- Oprawa
- miękka
- Liczba stron
- 830
- ISBN10
- 0387444599
- ISBN13
- 9780387444598
- Seria
- Kategorie
- Tagi
- Biznes
- Opis
- 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.