Pages that link to "Item:Q6097759"
From MaRDI portal
The following pages link to Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759):
Displaying 7 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 genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- (Q5150579) (← links)
- THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (Q5151281) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)