Pages that link to "Item:Q834904"
From MaRDI portal
The following pages link to Algorithms for the on-line quota traveling salesman problem (Q834904):
Displaying 15 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Particle swarm optimization-based algorithms for TSP and generalized TSP (Q2379966) (← links)
- Orienteering problem with time-windows and updating delay (Q2658039) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Biogeography migration algorithm for traveling salesman problem (Q4915778) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths (Q5855701) (← links)