Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
From MaRDI portal
Publication:5284220
DOI10.1287/ijoc.8.2.125zbMath0866.90130MaRDI QIDQ5284220
Giovanni Manzini, Luciano Margara, Giovanni Resta, Bruno Codenotti
Publication date: 6 July 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/97d5bb1ec0f263ac83c5284d9e8f4275cc24e775
90C35: Programming involving graphs or networks
90C06: Large-scale problems in mathematical programming
Related Items
Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Two-phase Pareto local search for the biobjective traveling salesman problem, Perturbation heuristics for the pickup and delivery traveling salesman problem, Guided local search and its application to the traveling salesman problem, Embedded local search approaches for routing optimization, Fast and high precision algorithms for optimization in large-scale genomic problems, A Neural-Network-Based Approach to the Double Traveling Salesman Problem