Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation

DOI10.1016/0167-6377(89)90037-0zbMath0668.90090MaRDI QIDQ1118536

Robert G. Bland, David F. Shallcross

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90037-0

zbMATH Keywords

heuristic; extremely large traveling salesman problems

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

Related Items

AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, The landscape of the traveling salesman problem, Solution of large-scale symmetric travelling salesman problems, Heuristic algorithms for visiting the customers in a rolling schedule environment, The traveling salesman problem: An overview of exact and approximate algorithms, Embedded local search approaches for routing optimization, Routing problems: A bibliography, Divide and conquer strategies for parallel TSP heuristics, Optimality conditions to the acyclic travelling salesman problem., FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM, Exact and inexact solution procedures for the order picking in an automated carousal conveyor

Cites Work

• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Tight bounds for christofides' traveling salesman heuristic
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item