Travelling Salesman and Assignment Problems: A Survey
From MaRDI portal
Publication:4196459
DOI10.1016/S0167-5060(08)70827-6zbMath0409.05041MaRDI QIDQ4196459
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)
90C35: Programming involving graphs or networks
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
90C09: Boolean programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
05C45: Eulerian and Hamiltonian graphs
Related Items
A genuinely polynomial primal simplex algorithm for the assignment problem, An algorithm for the traveling salesman problem with pickup and delivery customers, On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem, Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem, Simulated annealing for machine layout problems in the presence of zoning constraints, Special cases of the traveling salesman problem, Average performance of greedy heuristics for the integer knapsack problem., Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem, A restricted Lagrangean approach to the traveling salesman problem
