The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
From MaRDI portal
Publication:5265218
DOI10.1007/978-3-319-09758-9_4zbMath1348.90474OpenAlexW1028574099MaRDI QIDQ5265218
Publication date: 23 July 2015
Published in: Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09758-9_4
Related Items (max. 100)
On integer programming with bounded determinants ⋮ The width and integer optimization on simplices with bounded minors of the constraint matrices ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ FPT-algorithms for some problems related to integer programming
Cites Work
- Integer program with bimodular matrix
- Covering minima and lattice-point-free convex bodies
- On Padberg's conjecture about almost totally unimodular matrices
- On the minors of an incidence matrix and Smith normal form
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- On the maximal width of empty lattice simplices
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Polynomial algorithms in linear programming
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
