A family of inequalities for the generalized assignment polytope

Authors:
I. R. De Farias, Jr.;G. L. Nemhauser
Affiliations:
CORE, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
2001

Citing 4
Cited 6

The generalized assignment problem: valid inequalities and facets

Mathematical Programming: Series A and B
(1,k)-configuration facets for the generalized assignment problem

Mathematical Programming: Series A and B
A polyhedral approach to combinatorial complementarity programming problems

A polyhedral approach to combinatorial complementarity programming problems
Software section: MINTO, a mixed INTeger optimizer

Operations Research Letters

Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Polyhedral Study of the Cardinality Constrained Knapsack Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

Operations Research
Differential evolution algorithms for the generalized assignment problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A computational study of exact knapsack separation for the generalized assignment problem

Computational Optimization and Applications
Models for representing piecewise linear cost functions

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.