New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276)
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 bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm |
scientific article; zbMATH DE number 7195872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm |
scientific article; zbMATH DE number 7195872 |
Statements
New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (English)
0 references
4 May 2020
0 references
global optimization
0 references
nonconvex bilevel programming
0 references
Branch-and-Sandwich algorithm
0 references
0 references
0 references
0 references
0.8893325924873352
0 references
0.8592950105667114
0 references
0.8473246693611145
0 references
0.7879945039749146
0 references
0.7526928782463074
0 references
