Data Structures for Traveling Salesmen

DOI10.1006/jagm.1995.1018zbMath0829.90132OpenAlexW4246467599MaRDI QIDQ4837543

No author found.

Publication date: 25 July 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1018

zbMATH Keywords

traveling salesmantour representationchoice of data structuretree- based data structures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Data structures (68P05)

Related Items

Data structures and ejection chains for solving large-scale traveling salesman problems ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Exact solutions to linear programming problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A survey of very large-scale neighborhood search techniques ⋮ First vs. best improvement: an empirical study ⋮ Sorting signed permutations by reversals, revisited ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ New Rollout Algorithms for Combinatorial Optimization Problems ⋮ General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic ⋮ Implementation analysis of efficient heuristic algorithms for the traveling salesman problem ⋮ A note on single alternating cycle neighborhoods for the TSP ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem