Login / Signup
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming.
Tue Rauff Lind Christensen
Kim Allan Andersen
Andreas Klose
Published in:
Transp. Sci. (2013)
Keyphrases
</>
transportation problem
fixed charge
multiple choice
dynamic programming
network flow problem
network design
integer programming
open ended
linear programming
network flow
valid inequalities
reinforcement learning
np hard