The following pages link to (Q4540081):
Displayed 8 items.
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)