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

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	578-580
Number of pages	3
Journal	Operations Research Letters
Volume	40
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2012.10.003
Publication status	Published - 1 Nov 2012
Externally published	Yes

Keywords

Cutting plane algorithm
Finiteness
Integer programming

Access to Document

10.1016/j.orl.2012.10.003

Cite this

@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

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this