Advantageous Properties of Dual Transhipment Polyhedra

DOI10.1137/0403014zbMath0708.90054OpenAlexW2125106599MaRDI QIDQ3491311

Steven Cosares, Ilan Adler

Publication date: 1990

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e251dfcd807476617c6e96c538d5f56abcccb030

zbMATH Keywords

directed graphadjacency structuredual linear programstranshipment problemvertex visiting solution techniques

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

An O(\(n\)) bound for the diameter of transshipment polytopes ⋮ Gainfree Leontief substitution flow problems

This page was built for publication: Advantageous Properties of Dual Transhipment Polyhedra