A minimum expected regret model for the shortest path problem with solution-dependent probability distributions

DOI10.1016/j.cor.2016.07.007zbMath1391.90509OpenAlexW2493118020MaRDI QIDQ1652010

Eduardo Conde

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.007

zbMATH Keywords

stochastic programmingrobustness and sensitivity analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (3)

A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Stochastic linear programming. Models, theory, and computation.
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Stochastic programming. The state of the art. In honor of George B. Dantzig.
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and its applications
• An exact algorithm for the robust shortest path problem with interval data
• Modeling with Stochastic Programming
• Introduction to Stochastic Programming
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: A minimum expected regret model for the shortest path problem with solution-dependent probability distributions