A hybrid algorithm for the generalized assignment problem (Q3348709)
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: A hybrid algorithm for the generalized assignment problem |
scientific article; zbMATH DE number 4199973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid algorithm for the generalized assignment problem |
scientific article; zbMATH DE number 4199973 |
Statements
A hybrid algorithm for the generalized assignment problem (English)
0 references
1991
0 references
cutting planes
0 references
hybrid algorithm
0 references
generalized assignment
0 references
valid inequalities
0 references
branch and bound
0 references
fathcoming tests
0 references
0 references
0.9693785
0 references
0.9383915
0 references
0.9322072
0 references
0.92556775
0 references
0.92394614
0 references
0.92292416
0 references
0.92256314
0 references
0 references
