An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes (Q3978841)
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: An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes |
scientific article; zbMATH DE number 12963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes |
scientific article; zbMATH DE number 12963 |
Statements
An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes (English)
0 references
25 June 1992
0 references
multiperiod facility location
0 references
capacity expansion
0 references
mixed 0-1 linear formulation
0 references
Lagrangian relaxation
0 references
heuristics
0 references
0.9052183032035828
0 references
0.8305662274360657
0 references
0.8264477252960205
0 references
0.8170232176780701
0 references
