A \(k\)-level data structure for large-scale traveling salesman problems

DOI10.1007/S10479-016-2159-7zbMath1357.90124OpenAlexW2295076709MaRDI QIDQ512957

César Rego, Colin Osterman

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2159-7

zbMATH Keywords

algorithmscombinatorial optimizationdata structurestraveling salesman problemejection chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Global versus local search: the impact of population sizes on evolutionary algorithm performance

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• A data structure useful for finding Hamiltonian cycles
• TSP ejection chains
• Relaxed tours and path ejections for the traveling salesman problem
• Data structures and ejection chains for solving large-scale traveling salesman problems
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• A Subpath Ejection Method for the Vehicle Routing Problem
• Self-adjusting binary search trees
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• Data Structures for Traveling Salesmen
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A \(k\)-level data structure for large-scale traveling salesman problems