Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem''
type: Item
instance of: scholarly article
title: Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem''
zbMATH Open document ID: 1476.90337
author: Amadeu Almeida Coco
author: João Abreu
author: Thiago F. Noronha
author: Andréa Cynthia Santos
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6802494
MaRDI profile type: Publication
full work available at URL: s10898-017-0511-3
OpenAlex ID: W4242799399
cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data
cites work: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
cites work: The robust spanning tree problem with interval data
cites work: Robust discrete optimization and its applications
cites work: Minimising the maximum relative regret for linear programmes with interval objective function coefficients
DOI: 10.1007/S10898-017-0511-3
Recommended article: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Recommended article: The minmax regret robust shortest path problem in a finite multi-scenario model
Recommended article: Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem''
Recommended article: A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
Recommended article: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
Recommended article: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
Recommended article: A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Recommended article: A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
Recommended article: A minmax regret version of the time-dependent shortest path problem
Recommended article: Erratum to: ``Computational complexity of stochastic programming problems''
description: scientific article; zbMATH DE number 6802494