New Branch-and-Bound Rules for Linear Bilevel Programming (Q4021697)
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: New Branch-and-Bound Rules for Linear Bilevel Programming |
scientific article; zbMATH DE number 95968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New Branch-and-Bound Rules for Linear Bilevel Programming |
scientific article; zbMATH DE number 95968 |
Statements
New Branch-and-Bound Rules for Linear Bilevel Programming (English)
0 references
16 January 1993
0 references
Stackelberg game
0 references
decision theory
0 references
computational results
0 references
variable elimination
0 references
multiple decision
0 references
depth-first branch and bound algorithm
0 references
linear bilevel programming
0 references
0.8528091311454773
0 references
0.8389197587966919
0 references
0.816891610622406
0 references
