A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.03.041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2408198031 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Stackelberg minimum spanning tree game / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bilevel programming and price setting problems / rank | |||
Normal rank | |||
Latest revision as of 17:42, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game |
scientific article |
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
