A greedy algorithm for solving ordinary transportation problem with capacity constraints

DOI10.1016/j.orl.2017.05.009zbMath1409.90034MaRDI QIDQ1728270

Xianqiang Yang

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.05.009

zbMATH Keywords

duality; greedy algorithm; supermodularity; matroid; transportation problem

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)