Random walks on the vertices of transportation polytopes with constant number of sources
DOI10.1002/RSA.20222zbMATH Open1193.05149OpenAlexW2804591125WikidataQ56323850 ScholiaQ56323850MaRDI QIDQ3608299FDOQ3608299
Authors: Mary Cryan, Martin Dyer, Haiko Müller, L. Stougie 
Publication date: 4 March 2009
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20222
Recommendations
- scientific article; zbMATH DE number 2079356
- Random walks on polytopes and an affine interior point method for linear programming
- Random walks on polytopes and an affine interior point method for linear programming
- Random walks on polytopes of constant corank
- Random walks in polytopes and negative dependence
Sums of independent random variables; random walks (60G50) Paths and cycles (05C38) Random walks on graphs (05C81) Stochastic network models in operations research (90B15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Four questions on Birkhoff polytopes
- A polynomial time primal network simplex algorithm for minimum cost flows
- Title not available (Why is that?)
- Geometric bounds for eigenvalues of Markov chains
- The Distribution of a Product from Several Sources to Numerous Localities
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- A strongly polynomial minimum cost circulation algorithm
- Comparison theorems for reversible Markov chains
- On the number of faces of certain transportation polytopes
- Analyzing Glauber dynamics by comparison of Markov chains
- Approximate counting by dynamic programming
- A linear bound on the diameter of the transportation polytope
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Sampling contingency tables
- An application of Harnack inequalities to random walk on nilpotent quotients
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- On the graph structure of convex polyhedra in \(n\)-space
- Polynomial-time counting and sampling of two-rowed contingency tables
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- The Complexity of Vertex Enumeration Methods
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Random walks on the vertices of transportation polytopes with constant number of sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608299)
