Bicriterion shortest hyperpaths in random time-dependent networks

DOI10.1093/imaman/14.3.271zbMath1115.90321OpenAlexW2130965298MaRDI QIDQ4464024

Kim Allan Andersen, Lars Relund Nielsen

Publication date: 27 May 2004

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/14.3.271

zbMATH Keywords

directed hypergraphsbicriterion shortest pathrandom time-dependent networksshortest hyperpath

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Stochastic network models in operations research (90B15)

Related Items (5)

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ Finding the \(K\) shortest hyperpaths ⋮ Bicriterion Shortest Paths in Stochastic Time-Dependent Networks ⋮ Finding hypernetworks in directed hypergraphs

This page was built for publication: Bicriterion shortest hyperpaths in random time-dependent networks