The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158)
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: The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem |
scientific article; zbMATH DE number 6754202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem |
scientific article; zbMATH DE number 6754202 |
Statements
The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (English)
0 references
27 July 2017
0 references
bilevel optimization
0 references
cutting plane
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
0.87796485
0 references
0.87609535
0 references
0.8741055
0 references
0.8737242
0 references
0.8712889
0 references
