A family of inequalities for the generalized assignment polytope

Operations Research Letters

Volumn 29, Issue 2, 2001, Pages 49-55

  De Farias Jr , I R ^a   Nemhauser, G L ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Generalized assignment; Integer programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

GENERALIZED ASSIGNMENT PROBLEMS (GAP);

SET THEORY;

EID: 0035451608     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00086-4     Document Type: Article

References (12)

1. A survey of algorithms for the generalized assignment problem
2. A generalized assignment problem with special ordered sets: A polyhedral approach
3. The generalized assignment problem: Valid inequalities and facets
4. (1,k)-configuration facets for the generalized assignment problem
5. MINTO, a Mixed INTeger Optimizer
6. A branch-and-bound algorithm for the generalized assignment problem
7. A branch-and-price algorithm for the generalized assignment problem
8. Facets and strong valid inequalities for integer programs