Solving the CLSP by a Tabu Search Heuristic (Q4868835): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RELAX4 / rank | |||
Normal rank | |||
Revision as of 14:11, 28 February 2024
scientific article; zbMATH DE number 853162
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
