Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- 1 March 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1) , 1-16
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation ProblemMathematics of Operations Research, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Computing the volume of convex bodies: a case where randomness provably helps1991
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled TreesSIAM Journal on Discrete Mathematics, 1990
- Approximating the PermanentSIAM Journal on Computing, 1989
- The hirsch conjecture is true for (0, 1)-polytopesMathematical Programming, 1989
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- Two combinatorial applications of the Aleksandrov-Fenchel inequalitiesJournal of Combinatorial Theory, Series A, 1981
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973