Augmentation approaches for Mixed Integer Programming
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908564712325120 |
|---|---|
| author | Puerto, Justo Ruiz-Alba, Jose A. |
| author_facet | Puerto, Justo Ruiz-Alba, Jose A. |
| contents | This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and characterize a computable, finite test set for MIPs which can be embedded in a finite augmentation algorithm. Several examples illustrate the structure of this set and its relationship with previous approaches in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_08525 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Augmentation approaches for Mixed Integer Programming Puerto, Justo Ruiz-Alba, Jose A. Optimization and Control 90C11 This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and characterize a computable, finite test set for MIPs which can be embedded in a finite augmentation algorithm. Several examples illustrate the structure of this set and its relationship with previous approaches in the literature. |
| title | Augmentation approaches for Mixed Integer Programming |
| topic | Optimization and Control 90C11 |
| url | https://arxiv.org/abs/2507.08525 |