Asymptotic optimality of a transport-problem plan constructed by the minimum-element method

DOI10.1007/BF02667923zbMath0946.90049OpenAlexW2059133539MaRDI QIDQ1968520

M. K. Kravtsov, A. P. Krachkovskij

Publication date: 29 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02667923

zbMATH Keywords

linear programmingtransport problemminimum-element method

Mathematics Subject Classification ID

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

Related Items (4)

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ Cycle-based reducibility of multi-index transport-type systems of linear inequalities ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Multi-index transport problems with decomposition structure

Cites Work

• Asymptotic approach to the problem of \(k\)-median of a graph
• On the average number of steps of the simplex method of linear programming
• Metric aspects of integer linear programming
• Complexity of discrete multicriteria problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic optimality of a transport-problem plan constructed by the minimum-element method