A greedy algorithm for solving ordinary transportation problem with capacity constraints.

Published in: Oper. Res. Lett. (2017)

Keyphrases

greedy algorithm
transportation problem
capacity constraints
integer programming
lagrangian relaxation
minimum cost
network flow
worst case
objective function
knapsack problem
bicriteria
dynamic programming
lp relaxation
multistage
np hard
lower bound
constraint programming
combinatorial optimization