Travelling Salesman and Assignment Problems: A Survey
DOI10.1016/S0167-5060(08)70827-6zbMATH Open0409.05041OpenAlexW149977709MaRDI QIDQ4196459FDOQ4196459
Publication date: 1979
Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70827-6
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45) Boolean programming (90C09)
Cited In (10)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
- A restricted Lagrangean approach to the traveling salesman problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Average performance of greedy heuristics for the integer knapsack problem.
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
- Special cases of the traveling salesman problem
This page was built for publication: Travelling Salesman and Assignment Problems: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4196459)
