Pages that link to "Item:Q621685"
From MaRDI portal
The following pages link to Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685):
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)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem (Q2942467) (← links)
- A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
