Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
DOI10.1007/s10898-017-0511-3zbMath1476.90337OpenAlexW4242799399MaRDI QIDQ1675565
Andréa Cynthia Santos, Thiago F. Noronha, João Carlos Abreu Júnior, Amadeu Almeida Coco
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0511-3
Programming involving graphs or networks (90C35) Integer programming (90C10) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Cites Work
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Robust discrete optimization and its applications
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- The robust spanning tree problem with interval data
This page was built for publication: Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem