A minmax regret version of the time-dependent shortest path problem
Year of publication: |
1 November 2018
|
---|---|
Authors: | Conde, Eduardo ; Leal, Marina ; Puerto, Justo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 3 (1.11.), p. 968-981
|
Subject: | Integer Programming | Minmax-regret models | Benders decomposition | Theorie | Theory | Dekompositionsverfahren | Decomposition method | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Optimal train dispatching by Benders'-like reformulation
Lamorgese, Leonardo, (2016)
-
Sun, Peter, (2014)
-
Integer programming formulations and benders decomposition for the maximum induced matching problem
Ahat, Betül, (2018)
- More ...
-
A robust optimization model for distribution network design under a mixed integer set of scenarios
Conde, Eduardo, (2021)
-
Minmax regret combinatorial optimization problems with investments
Conde, Eduardo, (2017)
-
Global optimization for bilevel portfolio design : economic insights from the Dow Jones Index
González-Díaz, Julio, (2021)
- More ...