Special cases of travelling salesman problems and heuristics
From MaRDI portal
Publication:2639760
DOI10.1007/BF02019153zbMath0718.90027MaRDI QIDQ2639760
Publication date: 1990
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (9)
A general approach to avoiding two by two submatrices ⋮ Monge matrices make maximization manageable ⋮ Optimal wire ordering and spacing in low power semiconductor design ⋮ Spanning trees and shortest paths in Monge graphs ⋮ Perspectives of Monge properties in optimization ⋮ A Note On Kalmanson Matrices∗ ⋮ Optimal arcs for the traveling salesman problem ⋮ Pyramidal tours for the traveling salesman ⋮ Special cases of the traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Extreme Hamiltonian lines
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Efficiently solvable special cases of bottleneck travelling salesman problems
- The Euclidean traveling salesman problem is NP-complete
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Efficient special case algorithms for the n-line planar traveling salesman problem
- Approximation algorithms for convex hulls
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- On Some Properties of Shortest Hamiltonian Circuits
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Special cases of travelling salesman problems and heuristics
