(1,k)-configuration facets for the generalized assignment problem (Q914550)
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: (1,k)-configuration facets for the generalized assignment problem |
scientific article; zbMATH DE number 4149892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (1,k)-configuration facets for the generalized assignment problem |
scientific article; zbMATH DE number 4149892 |
Statements
(1,k)-configuration facets for the generalized assignment problem (English)
0 references
1990
0 references
In a previous paper [ibid., 31-52 (1990; Zbl 0694.90071)] the authors described various classes of valid inequalities for the generalized assignment problem. Continuing this work they derive here a family of facets for the polytope associated to this problem. The facet defining inequalities are based upon multiple knapsack constraints and are derived from (1,k)-configuration inequalities discussed in the paper mentioned above.
0 references
valid inequalities
0 references
generalized assignment problem
0 references
polytope
0 references
knapsack constraints
0 references
0.901555597782135
0 references
0.844702422618866
0 references
0.8399832844734192
0 references
0.7948298454284668
0 references
0.7923570275306702
0 references
