Pages that link to "Item:Q499157"
From MaRDI portal
The following pages link to Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157):
Displaying 12 items.
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← 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)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- A Heuristic Approach for Cluster TSP (Q3297279) (← links)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history (Q6148513) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
