Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
type: Item
instance of: scholarly article
title: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
zbMATH Open document ID: 0820.90066
DOI: 10.1007/BF01582563
author: Martin Dyer
author: Alan Frieze
published in: Mathematical Programming. Series A. Series B
publication date: 1994-08-10T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 617329
zbMATH Keywords: diameter of polytopes
zbMATH Keywords: random walks
zbMATH Keywords: totally unimodular matrix
MaRDI profile type: Publication
Wikidata QID: Q56324072
cites work: The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
cites work: Q3876608
cites work: Theoretical Properties of the Network Simplex Method
cites work: Q3976408
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Approximating the Permanent
cites work: Q3974981
cites work: Q4763400
cites work: The Hirsch conjecture is true for (0,1)-polytopes
cites work: Q3818127
cites work: Approximate counting, uniform generation and rapidly mixing Markov chains
cites work: Two combinatorial applications of the Aleksandrov-Fenchel inequalities
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
DBLP publication ID: journals/mp/DyerF94
description: scientific article; zbMATH DE number 617329