Pages that link to "Item:Q5891422"
From MaRDI portal
The following pages link to On sub-determinants and the diameter of polyhedra (Q5891422):
Displayed 36 items.
- On the diameter of lattice polytopes (Q282757) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- Primitive zonotopes (Q724942) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← 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 lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- A note on the diameter of convex polytope (Q2217504) (← 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)
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants (Q3174729) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Stable Clusterings and the Cones of Outer Normals (Q4685728) (← links)
- Good Clusterings Have Large Volume (Q4971590) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
- Formalizing the Face Lattice of Polyhedra (Q5049001) (← links)
- On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
- (Q5895188) (redirect page) (← 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)
- Advances on strictly \(\varDelta \)-modular IPs (Q6086017) (← links)
- New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)