The following pages link to (Q4205235):
Displaying 24 items.
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- On the core of traveling salesman games (Q1785381) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
- A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
