Pages that link to "Item:Q2780838"
From MaRDI portal
The following pages link to The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838):
Displaying 19 items.
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← links)
- TSP heuristics: domination analysis and complexity (Q1566378) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
- (Q3059494) (← links)
- (Q3115273) (← links)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
- (Q3813626) (← links)
- (Q3832350) (← links)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
