A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649)
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 tabu search/branch \& bound approach to solving the generalized assignment problem |
scientific article; zbMATH DE number 5781865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem |
scientific article; zbMATH DE number 5781865 |
Statements
A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (English)
0 references
9 September 2010
0 references
integer programming
0 references
tabu search
0 references
branch and bound
0 references
generalized assignment problem
0 references
0 references
0 references
0 references
0 references
0 references
0.888072669506073
0 references
0.8515712022781372
0 references
0.8417001366615295
0 references
0.8391541838645935
0 references
0.836726725101471
0 references
