Stochastic Shortest Path Problem with Delay Excess Penalty
From MaRDI portal
Publication:2883605
DOI10.1016/j.endm.2010.05.065zbMath1237.90175MaRDI QIDQ2883605
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
stochastic optimization; branch-and-bound; projected gradient algorithm; active set methods; restricted shortest path
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C15: Stochastic programming
90C27: Combinatorial optimization
Related Items
Constrained shortest path with uncertain transit times, Algorithms for non-linear and stochastic resource constrained shortest path, Routing Optimization Under Uncertainty
Cites Work