The traveling salesman problem: An update of research
DOI10.1002/NAV.3800300107zbMATH Open0521.90100OpenAlexW2050155999MaRDI QIDQ3671783FDOQ3671783
Author name not available (Why is that?)
Publication date: 1983
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800300107
surveygraphscombinatorial optimizationexact algorithmstraveling salesman problemsubtour eliminationcomputational testingcutting plane approachesminimum weight Hamiltonian cyclenonexact procedurestree formulation
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- P-Complete Approximation Problems
- Computer Solutions of the Traveling Salesman Problem
- A man-machine approach toward solving the traveling salesman problem
- A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
- Title not available (Why is that?)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
- Title not available (Why is that?)
- Title not available (Why is that?)
- Systematic generation of Hamiltonian circuits
- Title not available (Why is that?)
Cited In (11)
- Traveling salesman problem under categorization
- A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
- On perfectly two-edge connected graphs
- Minimum-weight two-connected spanning networks
- Emergency relief routing models for injured victims considering equity and priority
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- Two-edge connected spanning subgraphs and polyhedra
- On the resources allocation problem
- Shuffling heuristics for the storage location assignment in an AS/RS
This page was built for publication: The traveling salesman problem: An update of research
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671783)
