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_4zbMATH Open1348.90474OpenAlexW1028574099MaRDI QIDQ5265218FDOQ5265218
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
Recommendations
- On integer points in polyhedra
- On integer points in polyhedra: A lower bound
- On integer points of polyhedra of two types.
- Upper and lower bound results on the convex hull of integer points in polyhedra
- A simplicial approach to the determination of an integer point of a simplex
- On integer points in polygons
- On integer points in polygons
- Integer points in polyhedra
- Counting integer points in higher-dimensional polytopes
- On Counting Integral Points in a Convex Rational Polytope
Cites Work
- Polynomial algorithms in linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering minima and lattice-point-free convex bodies
- On the maximal width of empty lattice simplices
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Integer program with bimodular matrix
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the minors of an incidence matrix and Smith normal form
- On Padberg's conjecture about almost totally unimodular matrices
Cited In (5)
- FPT-algorithms for some problems related to integer programming
- 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
This page was built for publication: The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265218)
