The traveling salesman problem and its variations /

This volume provides information on 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, and branch and bound, and branch and cut algorithms.

Détails bibliographiques
Cote:Libro Electrónico
Autres auteurs: Gutin, Gregory, 1957-, Punnen, Abraham P.
Format: Électronique eBook
Langue:Inglés
Publié: Dordrecht ; Boston : Kluwer Academic Publishers, ©2002.
Collection:Combinatorial optimization ; v. 12.
Sujets:
Traveling salesman problem.
Combinatorial optimization.
Problèmes de tournées.
Optimisation combinatoire.
MATHEMATICS > Combinatorics.
Combinatorial optimization
Traveling salesman problem
Accès en ligne:Texto completo

Internet

Texto completo

Items no disponibles

Informations d'exemplaires de

Documents similaires