Sparsity and integrality gap transference bounds for integer programs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910367527993344 |
|---|---|
| author | Aliev, Iskander Celaya, Marcel Henk, Martin |
| author_facet | Aliev, Iskander Celaya, Marcel Henk, Martin |
| contents | We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs min{cx: x in P, x integer}, where P={x: Ax=b, x nonnegative} is a polyhedron in the standard form determined by an integer mxn matrix A and an integer vector b. The main result of the paper shows that the integrality gap drops exponentially in the size of support of the optimal solutions that correspond to the vertices of the integer hull of the polyhedron P. Additionally, we obtain a new proximity bound that estimates the distance from any point of P to its nearest integer point in P. The proofs make use of the results from the geometry of numbers and convex geometry. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_06605 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Sparsity and integrality gap transference bounds for integer programs Aliev, Iskander Celaya, Marcel Henk, Martin Optimization and Control 90C10, 52C07, 11H31 We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs min{cx: x in P, x integer}, where P={x: Ax=b, x nonnegative} is a polyhedron in the standard form determined by an integer mxn matrix A and an integer vector b. The main result of the paper shows that the integrality gap drops exponentially in the size of support of the optimal solutions that correspond to the vertices of the integer hull of the polyhedron P. Additionally, we obtain a new proximity bound that estimates the distance from any point of P to its nearest integer point in P. The proofs make use of the results from the geometry of numbers and convex geometry. |
| title | Sparsity and integrality gap transference bounds for integer programs |
| topic | Optimization and Control 90C10, 52C07, 11H31 |
| url | https://arxiv.org/abs/2311.06605 |