Pages that link to "Item:Q1681325"
From MaRDI portal
The following pages link to A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325):
Displayed 8 items.
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- On hub location problems in geographically flexible networks (Q6071054) (← links)
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
- The generalized close enough traveling salesman problem (Q6113445) (← links)