Augmentation approaches for Mixed Integer Programming

J. A. Ruiz, J. Puerto

In this work, we analyse 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.

Keywords: Test set, Agumentation Algorithm, MIPS

GT GELOCA I: Optimization models in facility location and service design.
September 3, 2026  9:00 AM
Aula B

M. Albareda Sambola, J. J. Salazar González

V. Blanco, M. Martínez-Antón, J. Puerto

J. Fernández Hernández, B. G.-Tóth, G. Méndez Vogel, V. Marianov

A. Marín, I. Espejo Miranda