Stochastic Shortest Path Problem with Delay Excess Penalty

DOI10.1016/j.endm.2010.05.065zbMath1237.90175OpenAlexW2031237185MaRDI QIDQ2883605

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

stochastic optimizationbranch-and-boundprojected gradient algorithmactive set methodsrestricted shortest path

Mathematics Subject Classification ID

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

Related Items (3)

Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Constrained shortest path with uncertain transit times ⋮ Routing Optimization Under Uncertainty

Cites Work

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

This page was built for publication: Stochastic Shortest Path Problem with Delay Excess Penalty