Login / Signup
A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem.
Bahram Alidaee
Gary A. Kochenberger
Published in:
Transp. Sci. (2005)
Keyphrases
</>
transportation problem
fixed charge
dynamic programming
network design
integer programming
valid inequalities
linear programming
capacity expansion
network flow problem
multistage
fixed cost
reinforcement learning
state space
minimum cost
lagrangian relaxation