A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649): Difference between revisions
From MaRDI portal
Latest revision as of 04:48, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem |
scientific article |
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