Enumeration and unimodular equivalence of empty delta-modular simplices
From MaRDI portal
Publication:6134052
DOI10.1007/978-3-031-35305-5_8zbMath1529.90052arXiv2303.01224MaRDI QIDQ6134052
No author found.
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.01224
unimodular equivalenceenumeration algorithmlattice simplexempty simplexbounded sub-determinantsdelta-modular matrix
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Canonical forms, reductions, classification (15A21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for mixed-integer convex minimization
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Constructive characterizations of the value-function of a mixed-integer program. I
- Integer points in polyhedra
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Constructive characterizations of the value function of a mixed-integer program. II
- On Lovász' lattice reduction and the nearest lattice point problem
- Covering minima and lattice-point-free convex bodies
- The b-hull of an integer program
- New bounds in some transference theorems in the geometry of numbers
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Classification of empty lattice 4-simplices of width larger than 2
- Optimality certificates for convex minimization and Helly numbers
- FPT-algorithms for some problems related to integer programming
- On the maximal width of empty lattice simplices
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Constructing lattice-free gradient polyhedra in dimension two
- Improving the Cook et al. proximity bound given integral valued constraints
- Lattice-free simplices with lattice width \(2d - o(d)\)
- Integer conic function minimization based on the comparison oracle
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- FPT-algorithm for computing the width of a simplex given by a convex hull
- A geometric approach to cut-generating functions
- On the complexity of quasiconvex integer minimization problem
- The structure of simple sets in \(\mathbb Z^3\)
- Integer Programming with a Fixed Number of Variables
- Minimal Valid Inequalities for Integer Constraints
- Terminal Quotient Singularities in Dimensions Three and Four
- On Four-Dimensional Terminal Quotient Singularities
- Quotient Singularities, Integer Ratios of Factorials, and the Riemann Hypothesis
- Integer programming duality: Price functions and sensitivity analysis
- On the width of lattice-free simplices
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- Short rational generating functions for lattice point problems
- A Strong Dual for Conic Mixed-Integer Programs
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases
- Hollow polytopes of large width
- Computing the Continuous Discretely
- Inequalities from Two Rows of a Simplex Tableau
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Linear and Integer Programming vs Linear Integration and Counting
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Lattice Tetrahedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Algorithms - ESA 2003
- The complete classification of empty lattice 4-simplices
