Solving the CLSP by a Tabu Search Heuristic (Q4868835): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RELAX4 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1996.13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979313354 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:16, 19 March 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
