eBook Téléchargement DRM Adobe 🛈
140,24

Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description

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: Researchers, practitioners, and academicians in mathematics, computer science, and operations research. Appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects
Pages
n.c
Collection
n.c
Parution
1983
Marque
Kluwer Academic Publishers
EAN papier
0306482134
EAN PDF
0306482134

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
1445 Ko
Prix
140,24 €

Suggestions personnalisées