Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003)
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: Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming |
scientific article; zbMATH DE number 7551222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming |
scientific article; zbMATH DE number 7551222 |
Statements
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (English)
0 references
30 June 2022
0 references
integer programming
0 references
maximum stable set problem
0 references
rank inequalities
0 references
cutting plane generation
0 references
bilevel programming
0 references
branch-and-cut
0 references
branch-and-bound
0 references
0 references
0 references
0.8362330794334412
0 references
0.7601686120033264
0 references
0.7507275938987732
0 references
0.7445845007896423
0 references
0.7374956011772156
0 references
