The generalized assignment problem: Valid inequalities and facets (Q909579)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The generalized assignment problem: Valid inequalities and facets |
scientific article; zbMATH DE number 4137529
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The generalized assignment problem: Valid inequalities and facets |
scientific article; zbMATH DE number 4137529 |
Statements
The generalized assignment problem: Valid inequalities and facets (English)
0 references
1990
0 references
The authors present various classes of valid inequalities and study properties of facet defining inequalities for the polytope associated with the generalized assignment problem. It is proved that a basic fractional solution to the linear programming relaxation can be eliminated by a facet associated with an individual knapsack constraint.
0 references
valid inequalities
0 references
facet defining inequalities
0 references
polytope
0 references
generalized assignment
0 references
knapsack
0 references
0 references
0 references
0.9367132
0 references
0.93309975
0 references
0.9198126
0 references
0.91613114
0 references
0.9160641
0 references
0.9127445
0 references
