A greedy algorithm for solving ordinary transportation problem with capacity constraints

DOI10.1016/j.orl.2017.05.009zbMath1409.90034OpenAlexW2613387527MaRDI 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

dualitygreedy algorithmsupermodularitymatroidtransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• A general model for matroids and the greedy algorithm
• A Monge property for the \(d\)-dimensional transportation problem
• A General Class of Greedily Solvable Linear Programs
• The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
• A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A greedy algorithm for solving ordinary transportation problem with capacity constraints