On the length of simplex paths: The assignment case
- 1 October 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 30 (3) , 243-260
- https://doi.org/10.1007/bf02591931
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some experiments with the pathological linear programs of N. ZadehMathematical Programming, 1978
- On the Assignment PolytopeSIAM Review, 1974
- On two special classes of transportation polytopesPublished by Springer Nature ,1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- The simplex algorithm with the pivot rule of maximizing criterion improvementDiscrete Mathematics, 1973
- How to Solve Linear InequalitiesThe American Mathematical Monthly, 1969
- Some results in probabilistic geometryProbability Theory and Related Fields, 1968
- ZufÄllige konvexe Polygone in einem RinggebietProbability Theory and Related Fields, 1968
- The d-step conjecture for polyhedra of dimension d<6Acta Mathematica, 1967