Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs.

Azuma Ohuchi Ikuo Kaji

Published in: Networks (1984)

Keyphrases

transportation problem
objective function
computational complexity
learning algorithm
cost function
dynamic programming
optimal solution
np hard
worst case
simulated annealing
linear programming
mathematical model
network flow