A double oracle approach to minmax regret optimization problems with interval data
Year of publication: |
1 November 2017
|
---|---|
Authors: | Gilbert, Hugo ; Spanjaard, Olivier |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 262.2017, 3 (1.11.), p. 929-943
|
Subject: | Combinatorial optimization | Branch and bound | Minmax regret | Robust optimization | Robust shortest paths | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Entscheidung unter Unsicherheit | Decision under uncertainty | Robustes Verfahren | Robust statistics | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Some robust inverse median problems on trees with interval costs
Le Xuan Dai, (2024)
-
Robust balancing of straight assembly lines with inerval task times
Gurevsky, E., (2013)
-
Chassein, André B., (2015)
- More ...
-
Robust ordinal regression for subsets comparisons with interactions
Gilbert, Hugo, (2025)
-
A preference-based approach to spanning trees and shortest paths problems****
Perny, Patrice, (2005)
-
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Escoffier, Bruno, (2010)
- More ...