A restricted-entry method for a transportation problem with piecewise- linear concave costs

DOI10.1016/0305-0548(94)90002-7zbMath0805.90078OpenAlexW1966678324MaRDI QIDQ1332825

Faruk Güder, Francis J. Nourie

Publication date: 5 September 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90002-7

zbMATH Keywords

transportationheuristicpiecewise-linear concave costs

Mathematics Subject Classification ID

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

Related Items (1)

Global and local search algorithms for concave cost transshipment problems

Cites Work

• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• Unnamed Item
• Unnamed Item

This page was built for publication: A restricted-entry method for a transportation problem with piecewise- linear concave costs