On exact solutions for the minmax regret spanning tree problem (Q337033)
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 6650669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On exact solutions for the minmax regret spanning tree problem |
scientific article; zbMATH DE number 6650669 |
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
0 references
0 references
0 references
0 references
0.8367792963981628
0 references
0.8291999101638794
0 references
0.8250814080238342
0 references
0.811269998550415
0 references
