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 | Dekompositionsverfahren | Decomposition method | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Graphentheorie | Graph theory |
-
Sun, Peter, (2014)
-
Progressive selection method for the coupled lot-sizing and cutting-stock problem
Wu, Tao, (2017)
-
Hub network design problem with capacity, congestion, and stochastic demand considerations
Bayram, Vedat, (2023)
- More ...
-
Leal, Marina, (2020)
-
New models for the location of controversial facilities : a bilevel programming approach
Labbé, Martine, (2019)
-
Global optimization for bilevel portfolio design : economic insights from the Dow Jones Index
González-Díaz, Julio, (2021)
- More ...