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

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

David F. Shallcross, Robert G. Bland

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

heuristicextremely large traveling salesman problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

Embedded local search approaches for routing optimization, Heuristic algorithms for visiting the customers in a rolling schedule environment, Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices, Routing problems: A bibliography, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Divide and conquer strategies for parallel TSP heuristics, Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries, An approximation algorithm for the clustered path travelling salesman problem, A data-guided lexisearch algorithm for the asymmetric traveling salesman problem, A 3/4 differential approximation algorithm for traveling salesman problem, An approximation algorithm for the clustered path travelling salesman problem, Instance-specific multi-objective parameter tuning based on fuzzy logic, Exact and inexact solution procedures for the order picking in an automated carousal conveyor, FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM, Optimality conditions to the acyclic travelling salesman problem., The traveling salesman problem: An overview of exact and approximate algorithms, The landscape of the traveling salesman problem, Travelling on graphs with small highway dimension, Discrete Set Handling, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Solution of large-scale symmetric travelling salesman problems

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