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.

Bibliographic Details
Call Number:Libro Electrónico
Other Authors: Gutin, Gregory, 1957-, Punnen, Abraham P.
Format: Electronic eBook
Language:Inglés
Published: Dordrecht ; Boston : Kluwer Academic Publishers, ©2002.
Series:Combinatorial optimization ; v. 12.
Subjects:
Traveling salesman problem.
Combinatorial optimization.
Problèmes de tournées.
Optimisation combinatoire.
MATHEMATICS > Combinatorics.
Combinatorial optimization
Traveling salesman problem
Online Access:Texto completo
Description
Summary: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.
Physical Description:1 online resource (xviii, 830 pages) : illustrations.
Bibliography:Includes bibliographical references (pages 761-806) and index.
ISBN:0306482134
9780306482137
1402006640
9781402006647

Similar Items