A simple finite cutting plane algorithm for integer programs

José Neto

doi:10.1016/j.orl.2012.10.003

A simple finite cutting plane algorithm for integer programs

José Neto

CNRS SAMOVAR UMR 5157

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

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.

langue originale	Anglais
Pages (de - à)	578-580
Nombre de pages	3
journal	Operations Research Letters
Volume	40
Numéro de publication	6
Les DOIs	https://doi.org/10.1016/j.orl.2012.10.003
état	Publié - 1 nov. 2012
Modification externe	Oui

Accès au document

10.1016/j.orl.2012.10.003

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@article{b68263b505804c249621b6d09c141f1d,

title = "A simple finite cutting plane algorithm for integer programs",

abstract = "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.",

keywords = "Cutting plane algorithm, Finiteness, Integer programming",

author = "Jos{\'e} Neto",

year = "2012",

month = nov,

day = "1",

doi = "10.1016/j.orl.2012.10.003",

language = "English",

volume = "40",

pages = "578--580",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "6",

}

TY - JOUR

T1 - A simple finite cutting plane algorithm for integer programs

AU - Neto, José

PY - 2012/11/1

Y1 - 2012/11/1

N2 - 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.

AB - 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.

KW - Cutting plane algorithm

KW - Finiteness

KW - Integer programming

UR - https://www.scopus.com/pages/publications/84869239740

U2 - 10.1016/j.orl.2012.10.003

DO - 10.1016/j.orl.2012.10.003

M3 - Article

AN - SCOPUS:84869239740

SN - 0167-6377

VL - 40

SP - 578

EP - 580

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

A simple finite cutting plane algorithm for integer programs

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation