A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159)
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: A mixed-integer bilevel programming approach for a competitive prioritized set covering problem |
scientific article; zbMATH DE number 6872084
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A mixed-integer bilevel programming approach for a competitive prioritized set covering problem |
scientific article; zbMATH DE number 6872084 |
Statements
A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (English)
0 references
24 May 2018
0 references
integer programming
0 references
bilevel programming
0 references
cutting planes
0 references
Stackelberg games
0 references
0 references
0 references
