Travelling Salesman and Assignment Problems: A Survey
From MaRDI portal
Publication:4196459
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)- 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
- Strategies for generating well centered tetrahedral meshes on industrial geometries
- 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)