A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
type: Item
instance of: scholarly article
title: A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
zbMATH Open document ID: 1391.90509
author: E. Conde
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6901258
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: stochastic programming
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.007
OpenAlex ID: W2493118020
cites work: Q3056948
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Minmax regret bottleneck problems with solution-induced interval uncertainty structure
cites work: Introduction to Stochastic Programming
cites work: Stochastic programming. The state of the art. In honor of George B. Dantzig.
cites work: Stochastic linear programming. Models, theory, and computation.
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: Modeling with Stochastic Programming
cites work: Robust discrete optimization and its applications
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: Q4040221
cites work: Q4526781
cites work: Q3818127
DOI: 10.1016/J.COR.2016.07.007
description: scientific article; zbMATH DE number 6901258