A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
From MaRDI portal
Publication:2307980
DOI10.1007/s12597-019-00396-xOpenAlexW2970693157WikidataQ127304550 ScholiaQ127304550MaRDI QIDQ2307980
Gary R. Waissi, Pragya Kaushal
Publication date: 25 March 2020
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-019-00396-x
Uses Software
Cites Work
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- TSP ejection chains
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Relaxed tours and path ejections for the traveling salesman problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Local Search for the Asymmetric Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Solution of a Large-Scale Traveling-Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
