The integrality number of an integer program
From MaRDI portal
Publication:2118127
DOI10.1007/s10107-021-01651-0zbMath1489.90065arXiv1904.06874OpenAlexW3023053744MaRDI QIDQ2118127
Miriam Schlöter, Joseph Paat, Robert Weismantel
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06874
Related Items
Notes on \(\{a,b,c\}\)-modular matrices, On lattice point counting in \(\varDelta\)-modular polyhedra, On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- On linear systems with integral valued solutions
- Integer program with bimodular matrix
- The b-hull of an integer program
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- A note on non-degenerate integer programs with small sub-determinants
- \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
- Distances between optimal solutions of mixed-integer programs
- Sparsity of integer solutions in the average case
- Submodular minimization under congruency constraints
- Integer Programming with a Fixed Number of Variables
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
- Integer Programming
- Minkowski's Convex Body Theorem and Integer Programming
- Normality and covering properties of affine semigroups
- Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
- Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
- Elementary Methods in Number Theory
- A strongly polynomial algorithm for bimodular integer linear programming
- The Integrality Number of an Integer Program
- The Distributions of Functions Related to Parametric Integer Optimization
- The stable set problem in graphs with bounded genus and bounded odd cycle packing number
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- On largest volume simplices and sub-determinants
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Sparse Solutions of Linear Diophantine Equations
