A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472)
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 6640288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game |
scientific article; zbMATH DE number 6640288 |
Statements
A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (English)
0 references
18 October 2016
0 references
Stackelberg games
0 references
spanning trees
0 references
branch-and-cut-and-price
0 references
0 references
0.9009682536125184
0 references
0.9005480408668518
0 references
0.8779734373092651
0 references
0.8659931421279907
0 references
0.7950971126556396
0 references
