Del 12 i serien Combinatorial Optimization
3 171 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
Written by reputable researchers, this book covers various important areas of study on Traveling Salesman Problem, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, and more.
