Adjacent vertices on transportation polytopes
- 1 June 1975
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 22 (2) , 365-374
- https://doi.org/10.1002/nav.3800220212
Abstract
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping‐stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes.Keywords
This publication has 6 references indexed in Scilit:
- Transportation polytopesJournal of Combinatorial Theory, Series B, 1972
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution ProblemsJournal of the ACM, 1972
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965
- Algorithm for finding a general formula for the non-negative solutions of a system of linear equationsUSSR Computational Mathematics and Mathematical Physics, 1964
- Maximum number of iterations in the transportation problemNaval Research Logistics Quarterly, 1959