Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem

被引：0
|
作者：
Amadeu Almeida Coco
João Carlos Abreu Júnior
Thiago F. Noronha
Andréa Cynthia Santos
机构：
[1] Universidade Federal de Minas Gerais,Departamento de Ciência da Computação
[2] Université de Technologie de Troyes,ICD
来源：
Journal of Global Optimization | 2017年 / 68卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：463 / 466
页数：3
相关论文
共 50 条
  • [1] An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
    Amadeu Almeida Coco
    João Carlos Abreu Júnior
    Thiago F. Noronha
    Andréa Cynthia Santos
    Journal of Global Optimization, 2014, 60 : 265 - 287
  • [2] An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
    Coco, Amadeu Almeida
    Abreu Junior, Joao Carlos
    Noronha, Thiago F.
    Santos, Andrea Cynthia
    JOURNAL OF GLOBAL OPTIMIZATION, 2014, 60 (02) : 265 - 287
  • [3] An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (vol 60, pg 265, 2014)
    Coco, Amadeu Almeida
    Abreu Junior, Joao Carlos
    Noronha, Thiago F.
    Santos, Andrea Cynthia
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 68 (02) : 463 - 466
  • [4] Reducing the Minmax Regret Robust Shortest Path Problem with Finite Multi-scenarios
    Pascoal, Marta M. B.
    Resende, Marisa
    MATHEMATICS OF ENERGY AND CLIMATE CHANGE, 2015, 2 : 247 - 262
  • [5] The minmax regret robust shortest path problem in a finite multi-scenario model
    Pascoal, Marta M. B.
    Resende, Marisa
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 241 : 88 - 111
  • [6] The minmax regret shortest path problem with interval arc lengths
    Kang, Jun-Gyu
    International Journal of Control and Automation, 2013, 6 (05): : 171 - 180
  • [7] Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
    Pascoal, Marta M. B.
    Resende, Marisa
    DISCRETE OPTIMIZATION, 2016, 22 : 122 - 140
  • [8] A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
    Chassein, Andre B.
    Goerigk, Marc
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) : 739 - 747
  • [9] A minmax regret version of the time-dependent shortest path problem
    Conde, Eduardo
    Leal, Marina
    Puerto, Justo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (03) : 968 - 981
  • [10] Integer programming formulations for the elementary shortest path problem
    Taccari, Leonardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) : 122 - 130
12345