Pages that link to "Item:Q968380"
From MaRDI portal
The following pages link to A memetic algorithm for the generalized traveling salesman problem (Q968380):
Displayed 14 items.
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- On fast trust region methods for quadratic models with linear constraints (Q499155) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem (Q2942467) (← links)
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)