Least possible time paths in stochastic, time-varying networks.
type: Item
instance of: scholarly article
title: Least possible time paths in stochastic, time-varying networks.
zbMATH Open document ID: 1042.90520
DOI: 10.1016/S0305-0548(98)00027-6
author: Elise Miller-Hooks
author: Hani Mahmassani
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 1975826
zbMATH Keywords: Stochastic dynamic networks
zbMATH Keywords: shortest paths
MaRDI profile type: Publication
cites work: Shortest Paths in Probabilistic Graphs
cites work: Shortest paths in networks with exponentially distributed arc lengths
cites work: Shortest paths in stochastic networks with ARC lengths having discrete distributions
cites work: 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: Application of a Technique for Research and Development Program Evaluation
cites work: Critical Path Analyses Via Chance Constrained and Stochastic Programming
cites work: Q3056948
cites work: On a routing problem
cites work: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
cites work: New Polynomial Shortest Path Algorithms and Their Computational Attributes
cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem
cites work: Shortest‐path methods: Complexity, interrelations and new propositions
cites work: Shortest path methods: A unifying approach
Wikidata QID: Q127955804
description: scientific article; zbMATH DE number 1975826