Pages that link to "Item:Q3439978"
From MaRDI portal
The following pages link to The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach (Q3439978):
Displaying 15 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- The Generalized Covering Salesman Problem (Q2815466) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- Discrete/Binary Approach (Q3649626) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- A fishing route optimization decision support system: the case of the tuna purse seiner (Q6090176) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
