Pages that link to "Item:Q2780838"

The following pages link to The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838):

Displayed 7 items.

• A survey of very large-scale neighborhood search techniques (Q697563) ‎ (← links)
• Upper bounds on ATSP neighborhood size. (Q1406047) ‎ (← links)
• Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) ‎ (← links)
• Domination analysis of some heuristics for the traveling salesman problem (Q1602706) ‎ (← links)
• Further extension of the TSP assign neighborhood (Q2491321) ‎ (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) ‎ (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) ‎ (← links)