A simple finite cutting plane algorithm for integer programs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2012

A simple finite cutting plane algorithm for integer programs

Résumé

A cutting plane algorithm is presented in order to solve linear integer programs in a finite number of iterations, under the assumption that the feasible region is bounded. The procedure also applies to the resolution of mixed integer programs in a finite number of iterations under the additional assumption that the optimal objective value is integral.

Dates et versions

hal-00795146 , version 1 (27-02-2013)

Identifiants

Citer

José Neto. A simple finite cutting plane algorithm for integer programs. Operations Research Letters, 2012, 40, pp.578-580. ⟨10.1016/j.orl.2012.10.003⟩. ⟨hal-00795146⟩
24 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More