"Anàlisi combinatòria." . . "Optimización combinatoria." . . "Operations research." . . "Traveling salesman problem." . . "Traveling salesman problem" . "Traveling-salesman problem." . "Computational complexity." . . "Problema del Viajante de Comercio." . . "Programació (Matemàtica)" . . "Mathematical optimization." . . "Calcolo combinatorio." . . "Optimisation combinatoire." . . "Algorithms." . . "Travelling-salesman-Problem." . . "analyse combinatoire optimisation [études diverses]" . . "Problèmes de tournées." . . "MATHEMATICS Combinatorics." . . "Handelsreizigersprobleem." . . . . . "The Traveling salesman problem and its variations" . . . "Electronic books" . "Electronic books"@en . . . . . "Handboeken (vorm)" . . . . . . . . "Livres électroniques" . . . . "The Traveling salesman problem and its variation" . . . . . "Llibres electrònics" . . . . . . . . . . . "The traveling salesman problem and its variations"@en . "The traveling salesman problem and its variations" . . . . . . . . "Libros electrónicos" . . "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."@en . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "The Traveling Salesman Problem and Its Variations" . . . . . "This volume, which contains chapters written by reputable researchers, 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, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. Audience This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects." . "\"This volume, which contains chapters written by reputable researchers, 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, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. Audience This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.\" -- Font no determinada." . . "Combinacions (Matemàtica)" . . "problème du voyageur de commerce [études diverses]" . . "Optimalizálás kombinatorikus." . . "Problème du voyageur de commerce." . . "Optimització combinatòria." . . "Combinatorial optimization." . . "Combinatorial optimization" . "Ottimizzazione (Matematica)" . . . .