Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823)
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: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development |
scientific article; zbMATH DE number 6379555
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development |
scientific article; zbMATH DE number 6379555 |
Statements
Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (English)
0 references
11 December 2014
0 references
bilevel programming
0 references
nonconvex inner problem
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.86788034
0 references
0.86702883
0 references
0.86425835
0 references
0 references
0.8597392
0 references
0.8584191
0 references
0.85385513
0 references
