Stochastic shortest path problem with delay excess penalty

DOI10.1016/J.ENDM.2010.05.065MaRDI QIDQ2883605zbMATH OpenOpenAlexFDO

Authors Abdel Lisser, Stefanie Kosuch

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.065

zbMATH Keywords

active set methodsbranch-and-boundprojected gradient algorithmrestricted shortest pathstochastic optimization

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• New reformulations of distributionally robust shortest path problem
• Stochastic shortest path problems with recourse
• Models and algorithm for stochastic shortest path problem
• An Analysis of Stochastic Shortest Path Problems
• scientific article; zbMATH DE number 4053318

Cites work

• The sample average approximation method applied to stochastic routing problems: a computational study
• The shortest route problem with constraints
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm

Cited in

(6)

• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• Delay-constrained shortest paths: approximation algorithms and second-order cone models
• Algorithms for non-linear and stochastic resource constrained shortest path
• Routing optimization under uncertainty
• New reformulations of distributionally robust shortest path problem
• Constrained shortest path with uncertain transit times

This page was built for publication: Stochastic shortest path problem with delay excess penalty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883605)