A k-level data structure for large-scale traveling salesman problems
From MaRDI portal
Publication:512957
DOI10.1007/S10479-016-2159-7zbMATH Open1357.90124OpenAlexW2295076709MaRDI QIDQ512957FDOQ512957
Authors: Colin Osterman, César Rego 
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
Recommendations
- scientific article; zbMATH DE number 437539
- The traveling salesman problem: An overview of exact and approximate algorithms
- Data Structures for Traveling Salesmen
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Data structures and ejection chains for solving large-scale traveling salesman problems
Cites Work
- Title not available (Why is that?)
- Self-adjusting binary search trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Data structures and ejection chains for solving large-scale traveling salesman problems
- TSP ejection chains
- Relaxed tours and path ejections for the traveling salesman problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Data Structures for Traveling Salesmen
- A data structure useful for finding Hamiltonian cycles
- A subpath ejection method for the vehicle routing problem
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
Cited In (3)
Uses Software
This page was built for publication: A \(k\)-level data structure for large-scale traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512957)
