Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
type: Item
instance of: scholarly article
title: Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
zbMATH Open document ID: 0922.90141
DOI: 10.1016/S0377-2217(97)00264-6
author: Ishwar Murthy
author: Sumit Sarkar
published in: European Journal of Operational Research
publication date: 1999-03-10T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 1260423
zbMATH Keywords: stochastic shortest path problem
zbMATH Keywords: pruning
MaRDI profile type: Publication
cites work: Note—An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path Problem
cites work: Arc Reduction and Path Preference in Stochastic Acyclic Networks
cites work: Q4003376
cites work: Generalized Dynamic Programming for Stochastic Combinatorial Optimization
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
cites work: Shortest Paths in Probabilistic Graphs
cites work: Stochastic spanning tree problem
cites work: Algorithms for finding paths with multiple constraints
cites work: Shortest path problems with node failures
cites work: Technical Note—A Note on the Stochastic Shortest Route Problem
cites work: Optimal paths in graphs with stochastic or multidimensional weights
cites work: Optimal paths in probabilistic networks: A case with temporary preferences
cites work: Solving min-max shortest-path problems on a network
cites work: A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
cites work: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
cites work: The Stochastic Shortest Route Problem
cites work: Q4062203
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
Recommended article: Stochastic shortest path problem with delay excess penalty
Recommended article: Stochastic shortest path problems with recourse
Recommended article: An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
Recommended article: Stochastic shortest path problems with piecewise-linear concave utility functions
Recommended article: Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
Recommended article: Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
Recommended article: The stochastic shortest path problem: a polyhedral combinatorics perspective
Recommended article: An Analysis of Stochastic Shortest Path Problems
Recommended article: Stochastic shortest paths with recourse
description: scientific article; zbMATH DE number 1260423