On exact solutions for the minmax regret spanning tree problem (Q337033): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SteinLib / rank | |||
Normal rank | |||
Revision as of 21:14, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On exact solutions for the minmax regret spanning tree problem |
scientific article |
Statements
On exact solutions for the minmax regret spanning tree problem (English)
0 references
10 November 2016
0 references
minimum spanning tree
0 references
minmax regret
0 references
robust optimization
0 references
interval uncertainty
0 references
branch-and-cut
0 references
benders decomposition
0 references
