Asymptotic expected performance of some TSP heuristics: An empirical evaluation
From MaRDI portal
Publication:1823875
DOI10.1016/0377-2217(89)90217-8zbMath0681.90082OpenAlexW2033382867MaRDI QIDQ1823875
Hoon Liong Ong, Huei-Chuen Huang
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90217-8
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
A parallel tabu search algorithm for large traveling salesman problems, Routing problems: A bibliography, Divide and conquer strategies for parallel TSP heuristics, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, The traveling salesman problem: An overview of exact and approximate algorithms
Cites Work
- Worst-case analysis of two travelling salesman heuristics
- The Euclidean traveling salesman problem is NP-complete
- Approximate Traveling Salesman Algorithms
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Some Simple Applications of the Travelling Salesman Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item