A double oracle approach to minmax regret optimization problems with interval data (Q1683128)
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 6816192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A double oracle approach to minmax regret optimization problems with interval data |
scientific article; zbMATH DE number 6816192 |
Statements
A double oracle approach to minmax regret optimization problems with interval data (English)
0 references
6 December 2017
0 references
combinatorial optimization
0 references
branch and bound
0 references
minmax regret
0 references
robust optimization
0 references
robust shortest paths
0 references
0 references
0.7947267293930054
0 references
0.756829023361206
0 references
0.7489067912101746
0 references
0.7477073669433594
0 references
