Pages that link to "Item:Q4645932"
From MaRDI portal
The following pages link to Implementation of a linear time algorithm for certain generalized traveling salesman problems (Q4645932):
Displaying 13 items.
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems (Q1090604) (← 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)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study (Q2884495) (← links)
- (Q4494938) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
