On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705)
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: On the computational complexity of uncapacitated multi-plant lot-sizing problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of uncapacitated multi-plant lot-sizing problems |
scientific article |
Statements
On the computational complexity of uncapacitated multi-plant lot-sizing problems (English)
0 references
5 May 2021
0 references
multi-plant lot-sizing
0 references
production planning
0 references
computational complexity
0 references
NP-hard
0 references
0 references
0 references
0 references
0 references
0.8476223945617676
0 references
0.7944985032081604
0 references
0.7830014228820801
0 references
0.778346061706543
0 references
0.7642773985862732
0 references
