The following pages link to (Q2867371):
Displaying 7 items.
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
