A statistical approach to the tsp

DOI10.1002/net.3230070303zbMath0398.90103OpenAlexW1979437687MaRDI QIDQ4182284

Bruce L. Golden

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070303

zbMATH Keywords

Traveling Salesman ProblemHeuristicStatistical ApproachRandomly Generated Networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Related Items

Randomized algorithms in combinatorial optimization: A survey ⋮ A computational evaluation of optimal solution value estimation procedures ⋮ Continuous approximation formulas for location problems ⋮ Probabilistic analysis of solving the assignment problem for the traveling salesman problem ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ A heuristic approximation of the worst case of Shellsort ⋮ Point estimation of a global optimum for large combinatorial problems ⋮ Dividing a Territory Among Several Vehicles ⋮ Semi-greedy heuristics: An empirical study ⋮ Heuristic methods and applications: A categorized survey ⋮ Approximation algorithms with constant ratio for general cluster routing problems

Cites Work

• Implementing vehicle routing algorithms
• Computer Solutions of the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem
• Unnamed Item
• Unnamed Item