New branch-and-Cut algorithm for bilevel linear programming (Q2471104)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5236379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New branch-and-Cut algorithm for bilevel linear programming |
scientific article; zbMATH DE number 5236379 |
Statements
New branch-and-Cut algorithm for bilevel linear programming (English)
0 references
18 February 2008
0 references
Bilevel linear programming
0 references
Gomory cuts
0 references
Linear mixed 0-1 integer programming
0 references
Branch-and-cut algorithms
0 references
0 references
0.8292344212532043
0 references
0.8180884122848511
0 references
0.816891610622406
0 references
0.8153889179229736
0 references
