Pages that link to "Item:Q5202515"
From MaRDI portal
The following pages link to A new heuristic for the traveling salesman problem (Q5202515):
Displaying 25 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- New TSP construction heuristics and their relationships to the 2-Opt (Q1806710) (← links)
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
- A tour construction heuristic for the travelling salesman problem (Q3157386) (← links)
- A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
- (Q3820397) (← links)
- Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce (Q4016774) (← links)
- Fast Heuristics for Large Geometric Traveling Salesman Problems (Q4030791) (← links)
- On the Significance of the Initial Solution in Travelling Salesman Heuristics (Q4319780) (← links)
- On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem (Q4427335) (← links)
- New Monitoring Parameter for the Traveling Salesman Problem (Q4492343) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- (Q4861868) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)