Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034)
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: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches |
scientific article; zbMATH DE number 849226
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches |
scientific article; zbMATH DE number 849226 |
Statements
Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (English)
0 references
28 February 1996
0 references
generalized assignment problem
0 references
minimum cost assignment
0 references
review of exact and heuristic methods
0 references
\(\lambda\)-generation mechanism
0 references
simulated annealing
0 references
tabu search
0 references
branch-and-bound tree search
0 references
set partitioning
0 references
0 references
0 references
0 references
0 references
0 references
0.9472636
0 references
0.9171488
0 references
0.9089777
0 references
0.8977413
0 references
0.89561915
0 references
0.8917427
0 references
0.8902935
0 references
0.88870907
0 references
