Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
type: Item
instance of: scholarly article
title: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
zbMATH Open document ID: 1387.90266
author: Marta M. B. Pascoal
author: Marisa Resende
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6872100
zbMATH Keywords: robust shortest path
zbMATH Keywords: discrete scenarios
zbMATH Keywords: dynamic preprocessing
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.11.001
OpenAlex ID: W2196377485
cites work: On the robust shortest path problem.
cites work: The minmax regret robust shortest path problem in a finite multi-scenario model
cites work: Reduction approaches for robust shortest path problems
cites work: Solving min-max shortest-path problems on a network
cites work: Q3056948
cites work: Fast Evaluation of Union-Intersection Expressions
cites work: The robust shortest path problem with interval data via Benders decomposition
DOI: 10.1016/J.DISOPT.2015.11.001
description: scientific article; zbMATH DE number 6872100