A family of inequalities for the generalized assignment polytope

I. R. De Farias; G. L. Nemhauser

doi:10.1016/S0167-6377(01)00086-4

A family of inequalities for the generalized assignment polytope

I. R. De Farias, G. L. Nemhauser

Industrial Engineering

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

17 Scopus citations

Abstract

We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness.

Original language	English
Pages (from-to)	49-55
Number of pages	7
Journal	Operations Research Letters
Volume	29
Issue number	2
DOIs	https://doi.org/10.1016/S0167-6377(01)00086-4
State	Published - Sep 2001

Keywords

Branch-and-cut
Generalized assignment
Integer programming

Access to Document

10.1016/S0167-6377(01)00086-4

Cite this

@article{03175973d6184860b8ce6ecd94537df6,

title = "A family of inequalities for the generalized assignment polytope",

abstract = "We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness.",

keywords = "Branch-and-cut, Generalized assignment, Integer programming",

author = "{De Farias}, {I. R.} and Nemhauser, {G. L.}",

year = "2001",

month = sep,

doi = "10.1016/S0167-6377(01)00086-4",

language = "English",

volume = "29",

pages = "49--55",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "2",

}

TY - JOUR

T1 - A family of inequalities for the generalized assignment polytope

AU - De Farias, I. R.

AU - Nemhauser, G. L.

PY - 2001/9

Y1 - 2001/9

N2 - We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness.

AB - We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness.

KW - Branch-and-cut

KW - Generalized assignment

KW - Integer programming

UR - http://www.scopus.com/inward/record.url?scp=0035451608&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(01)00086-4

DO - 10.1016/S0167-6377(01)00086-4

M3 - Article

AN - SCOPUS:0035451608

SN - 0167-6377

VL - 29

SP - 49

EP - 55

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

A family of inequalities for the generalized assignment polytope

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this