Pages that link to "Item:Q2940530"
From MaRDI portal
The following pages link to An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530):
Displayed 5 items.
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)