Testing additive integrality gaps
From MaRDI portal
Publication:378120
DOI10.1007/s10107-012-0518-yzbMath1280.90086OpenAlexW3137802574MaRDI QIDQ378120
Dömötör Pálvölgyi, Nicolai Hähnle, Friedrich Eisenbrand, Gennady Shmonin
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0518-y
Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items (4)
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ Distances to lattice points in knapsack polyhedra ⋮ On the lattice programming gap of the group problems ⋮ Error bounds for mixed integer linear optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing conic TDI systems is hard
- The complexity of recognizing linear systems with certain integrality properties
- Decomposition of regular matroids
- On total dual integrality
- Lattice translates of a polytope and the Frobenius problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of the Frobenius problem
- Computing the integer programming gap
- Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra
- Integer Programming with a Fixed Number of Variables
- Parametric Integer Programming in Fixed Dimension
- A polynomial-time test for total dual integrality in fixed dimension
- Integer Rounding for Polymatroid and Branching Optimization Problems
- On the complexity of integer programming
- Node-Packing Problems with Integer Rounding Properties
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Integral Extreme Points
This page was built for publication: Testing additive integrality gaps
