Login / Signup
A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design.
Matthias Bender
Jörg Kalcsics
Stefan Nickel
Martin Pouls
Published in:
Eur. J. Oper. Res. (2018)
Keyphrases
</>
cost function
computational complexity
optimal solution
multi period
objective function
np hard
dynamic programming
scheduling problem
worst case
simulated annealing
resource allocation
input output
benchmark problems
routing problem