Interval data minmax regret network optimization problems (Q1827805)
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 2083747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interval data minmax regret network optimization problems |
scientific article; zbMATH DE number 2083747 |
Statements
Interval data minmax regret network optimization problems (English)
0 references
6 August 2004
0 references
Minmax regret optimization
0 references
Spanning tree
0 references
Shortest path
0 references
0.8383695483207703
0 references
0.8367792963981628
0 references
0.829005777835846
0 references
0.8150167465209961
0 references
0.8136608004570007
0 references
