Login / Signup
Route recombination for deterministic and non-deterministic orienteering problems with time windows: A dynamic programming approach.
Trong-Hieu Tran
Cédric Pralet
Hélène Fargier
Published in:
Comput. Oper. Res. (2024)
Keyphrases
</>
dynamic programming
randomized algorithms
building blocks
stochastic optimization problems
real time
optimization problems
np complete
single machine
stochastic methods
multi agent
lower bound
traveling salesman problem
problems involving
solving problems
relaxation algorithm