An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions (Q336816)
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: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions |
scientific article; zbMATH DE number 6650585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions |
scientific article; zbMATH DE number 6650585 |
Statements
An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions (English)
0 references
10 November 2016
0 references
bilevel optimization
0 references
bilevel mixed integer linear programming
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0.8650501370429993
0 references
0.8250913023948669
0 references
0.8188194036483765
0 references
0.8147543668746948
0 references
0.8115272521972656
0 references
