Solving the CLSP by a Tabu Search Heuristic (Q4868835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 853162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the CLSP by a Tabu Search Heuristic |
scientific article; zbMATH DE number 853162 |
Statements
Solving the CLSP by a Tabu Search Heuristic (English)
0 references
29 April 1996
0 references
production planning
0 references
tabu search
0 references
trans-shipment
0 references
multi-item, single-level, capacitated, dynamic lot-sizing problem
0 references
minimum-cost network flow
0 references
0.90538406
0 references
0 references
0.87426555
0 references
0.8503934
0 references
0.84609705
0 references
0.84468424
0 references
0.8443097
0 references
