{"ID":2895687,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.08525","arxiv_id":"2507.08525","title":"Augmentation approaches for Mixed Integer Programming","abstract":"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.","short_abstract":"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 au...","url_abs":"https://arxiv.org/abs/2507.08525","url_pdf":"https://arxiv.org/pdf/2507.08525v2","authors":"[\"Justo Puerto\",\"Jose A. Ruiz-Alba\"]","published":"2025-07-11T12:24:53Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}