Lagrangean relaxation-based algorithm for bi-level problems (Q2943804)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6478775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrangean relaxation-based algorithm for bi-level problems |
scientific article; zbMATH DE number 6478775 |
Statements
Lagrangean relaxation-based algorithm for bi-level problems (English)
0 references
4 September 2015
0 references
mixed-integer bi-level programming
0 references
Lagrangean relaxation
0 references
sub-gradient method
0 references
competitive bi-level capacitated facility location problem
0 references
0 references
0.7592388391494751
0 references
0.7512758374214172
0 references
0.7502774000167847
0 references
0.7418555021286011
0 references
