The Traveling Salesman Problem : A Computational Study /

Mostrar otras versiones (3)

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest rou...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Applegate, David L. (Autor), Bixby, Robert E. (Autor), Chvátal, Vašek (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Princeton, NJ : Princeton University Press, [2011]
Edición:Course Book
Colección:Princeton Series in Applied Mathematics ; 40
Temas:
Traveling salesman problem.
MATHEMATICS / Applied.
AT&T Labs.
Accuracy and precision.
Addition.
Algorithm.
Analysis of algorithms.
Applied mathematics.
Approximation algorithm.
Approximation.
Basic solution (linear programming).
Best, worst and average case.
Bifurcation theory.
Big O notation.
CPLEX.
CPU time.
Calculation.
Chaos theory.
Column generation.
Combinatorial optimization.
Computation.
Computational resource.
Computer.
Connected component (graph theory).
Connectivity (graph theory).
Convex hull.
Cutting-plane method.
Delaunay triangulation.
Determinism.
Disjoint sets.
Dynamic programming.
Ear decomposition.
Engineering.
Enumeration.
Equation.
Estimation.
Euclidean distance.
Euclidean space.
Family of sets.
For loop.
Genetic algorithm.
George Dantzig.
Georgia Institute of Technology.
Greedy algorithm.
Hamiltonian path.
Hospitality.
Hypergraph.
Implementation.
Instance (computer science).
Institute.
Integer.
Iteration.
Linear inequality.
Linear programming.
Mathematical optimization.
Mathematics.
Model of computation.
Neuroscience.
Notation.
Operations research.
Optimization problem.
Order by.
Pairwise.
Parameter (computer programming).
Parity (mathematics).
Percentage.
Polyhedron.
Polytope.
Pricing.
Princeton University.
Processing (programming language).
Project.
Quantity.
Reduced cost.
Requirement.
Result.
Rice University.
Rutgers University.
Scientific notation.
Search algorithm.
Search tree.
Self-similarity.
Simplex algorithm.
Solution set.
Solver.
Source code.
Special case.
Stochastic.
Subroutine.
Subsequence.
Subset.
Summation.
Test set.
Theorem.
Theory.
Time complexity.
Trade-off.
Travelling salesman problem.
Tree (data structure).
Upper and lower bounds.
Variable (computer science).
Variable (mathematics).
Acceso en línea:Texto completo
Texto completo
Tabla de Contenidos:
  • Frontmatter
  • Contents
  • Preface
  • Chapter 1. The Problem
  • Chapter 2. Applications
  • Chapter 3. Dantzig, Fulkerson, and Johnson
  • Chapter 4. History of TSP Computation
  • Chapter 5. LP Bounds and Cutting Planes
  • Chapter 6. Subtour Cuts and PQ-Trees
  • Chapter 7. Cuts from Blossoms and Blocks
  • Chapter 8. Combs from Consecutive Ones
  • Chapter 9. Combs from Dominoes
  • Chapter 10. Cut Metamorphoses
  • Chapter 11. Local Cuts
  • Chapter 12. Managing the Linear Programming Problems
  • Chapter 13. The Linear Programming Solver Chapter 14. Branching
  • Chapter 14. Branching
  • Chapter 15. Tour Finding
  • Chapter 16. Computation
  • Chapter 17. The Road Goes On
  • Bibliography
  • Index

Ejemplares similares