Data Structures for Traveling Salesmen

DOI10.1006/JAGM.1995.1018MaRDI QIDQ4837543zbMATH OpenOpenAlexFDO

Authors

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

choice of data structuretour representationtraveling salesmantree- based data structures

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 437539
• Data structures and ejection chains for solving large-scale traveling salesman problems
• A \(k\)-level data structure for large-scale traveling salesman problems
• scientific article; zbMATH DE number 4195700
• Pyramidal tours for the traveling salesman
• scientific article; zbMATH DE number 6011205
• The travelling salesman and the PQ-tree
• scientific article; zbMATH DE number 7059568
• Data Structures' Maxima
• scientific article; zbMATH DE number 1830754

Cited in

(22)

• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Sorting signed permutations by reversals, revisited
• Data structures and ejection chains for solving large-scale traveling salesman problems
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
• Exact solutions to linear programming problems
• First vs. best improvement: an empirical study
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• A note on single alternating cycle neighborhoods for the TSP
• The travelling salesman and the PQ-tree.
• scientific article; zbMATH DE number 437539 (Why is no real title available?)
• The Traveler's Problem
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• How traveling salespersons prove their identity
• New Rollout Algorithms for Combinatorial Optimization Problems
• Ladders for Travelling Salesmen
• A \(k\)-level data structure for large-scale traveling salesman problems
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Ejection chain and filter-and-fan methods in combinatorial optimization
• A survey of very large-scale neighborhood search techniques
• Global versus local search: the impact of population sizes on evolutionary algorithm performance
• A data structure useful for finding Hamiltonian cycles

This page was built for publication: Data Structures for Traveling Salesmen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837543)