Pages that link to "Item:Q1330890"

The following pages link to Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890):

Displaying 20 items.

• Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
• On the shadow simplex method for curved polyhedra (Q728496) (← links)
• Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
• On the recognition of \(\{a,b,c\}\)-modular matrices (Q2061884) (← links)
• Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
• Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
• On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
• A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
• An asymptotically improved upper bound on the diameter of polyhedra (Q2324633) (← links)
• Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
• Geometric random edge (Q2364496) (← links)
• Circuit walks in integral polyhedra (Q2673232) (← links)
• Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
• On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
• GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY (Q5204661) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965566) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
• On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)