Pages that link to "Item:Q5202515"

The following pages link to A new heuristic for the traveling salesman problem (Q5202515):

Displaying 11 items.

• 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)
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• The travelling salesman and the PQ-tree (Q4645944) (← links)
• Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)