A Lagrangean dual ascent algorithm for simple plant location problems (Q911446): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(88)90029-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082216275 / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean dual ascent algorithm for simple plant location problems |
scientific article |
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 references
