Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344)
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: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem |
scientific article; zbMATH DE number 4215666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem |
scientific article; zbMATH DE number 4215666 |
Statements
Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (English)
0 references
1991
0 references
variable splitting approach
0 references
capacitated plant location
0 references
auxiliary variables
0 references
relaxation
0 references
heuristics
0 references
0 references
0 references
0.8625578880310059
0 references
0.8604472875595093
0 references
0.8481980562210083
0 references
0.8439673781394958
0 references
0.8288621306419373
0 references
