Sparsity and integrality gap transference bounds for integer programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6850361 (Why is no real title available?)
- A geometric inequality with applications to linear forms
- An Introduction to the Geometry of Numbers
- An integer analogue of Carathéodory's theorem
- Carathéodory bounds for integer cones
- Diophantische Gleichungen.
- Distance-sparsity transference for vertices of corner polyhedra
- Distances between optimal solutions of mixed-integer programs
- Distances to lattice points in knapsack polyhedra
- Improving proximity bounds using sparsity
- Improving the Cook et al. proximity bound given integral valued constraints
- New Bounds for the Vertices of the Integer Hull
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
- Sensitivity theorems in integer linear programming
- Some polyhedra related to combinatorial problems
- Sparse Solutions of Linear Diophantine Equations
- Sparse representation of vectors in lattices and semigroups
- The distributions of functions related to parametric integer optimization
- The support of integer optimal solutions
- The value function of a mixed integer program: I
- The value function of an integer program
This page was built for publication: Sparsity and integrality gap transference bounds for integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030577)
