The landscape of the traveling salesman problem

DOI10.1016/0375-9601(92)90557-3zbMath0979.90509OpenAlexW2016851559WikidataQ56992306 ScholiaQ56992306MaRDI QIDQ5955738

Wolfgang Schnabl, Peter F. Stadler

Publication date: 18 February 2002

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0375-9601(92)90557-3

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Rugged and Elementary Landscapes ⋮ Random walks and orthogonal functions associated with highly symmetric graphs ⋮ Autocorrelation coefficient for the graph bipartitioning problem ⋮ Traveling salesman problem with clustering ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Fourier and Taylor series on fitness landscapes ⋮ Coarse-Graining Large Search Landscapes Using Massive Edge Collapse ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ The component model for elementary landscapes and partial neighborhoods ⋮ Neutrality in fitness landscapes. ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ The linear ordering problem: instances, search space analysis and algorithms ⋮ Optimization by hierarchical mutant production

Cites Work

• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item