Pages that link to "Item:Q5888090"
From MaRDI portal
The following pages link to Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem (Q5888090):
Displaying 13 items.
- 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)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Generalized network design problems. (Q1810478) (← 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)
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem (Q3786302) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350) (← links)
