A Lagrangean dual ascent algorithm for simple plant location problems (Q911446)
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: A Lagrangean dual ascent algorithm for simple plant location problems |
scientific article; zbMATH DE number 4141777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangean dual ascent algorithm for simple plant location problems |
scientific article; zbMATH DE number 4141777 |
Statements
A Lagrangean dual ascent algorithm for simple plant location problems (English)
0 references
1988
0 references
separable Lagrangean relaxation
0 references
plant location
0 references
Benders inequalities
0 references
Lagrangean dual ascent procedure
0 references
heuristic
0 references
integrality gaps
0 references
0 references
0.880240261554718
0 references
0.8438107967376709
0 references
0.8329440355300903
0 references
0.8325815796852112
0 references
0.8324621915817261
0 references
