On the use of intersection cuts for bilevel optimization (Q1800991)
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: On the use of intersection cuts for bilevel optimization |
scientific article; zbMATH DE number 6966223
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the use of intersection cuts for bilevel optimization |
scientific article; zbMATH DE number 6966223 |
Statements
On the use of intersection cuts for bilevel optimization (English)
0 references
26 October 2018
0 references
mixed integer bilevel linear program
0 references
branch-and-bound
0 references
linear inequalities
0 references
intersection cuts
0 references
0 references
0.97985584
0 references
0 references
0.8992166
0 references
0.8960219
0 references
0.8925929
0 references
0.8925855
0 references
0.88584065
0 references
0.8857882
0 references
0.8856578
0 references
