Travelling Salesman and Assignment Problems: A Survey

DOI10.1016/S0167-5060(08)70827-6zbMath0409.05041OpenAlexW149977709MaRDI QIDQ4196459

Rainer E. Burkard

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

zbMATH Keywords

SurveyTraveling Salesman ProblemLinear Assignment Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem ⋮ Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem ⋮ Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Average performance of greedy heuristics for the integer knapsack problem. ⋮ Simulated annealing for machine layout problems in the presence of zoning constraints ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ A restricted Lagrangean approach to the traveling salesman problem ⋮ Special cases of the traveling salesman problem ⋮ An algorithm for the traveling salesman problem with pickup and delivery customers

This page was built for publication: Travelling Salesman and Assignment Problems: A Survey