Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
From MaRDI portal
Publication:3649590
DOI10.1007/978-3-540-85646-7_6zbMath1176.90641OpenAlexW27922504MaRDI QIDQ3649590
Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen
Publication date: 4 December 2009
Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_6
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)
Related Items (3)
Embedding a state space model into a Markov decision process ⋮ Ranking paths in stochastic time-dependent networks ⋮ Shortest paths with a cost constraint: a probabilistic analysis
Cites Work
- Multiobjective programming and planning
- A directed hypergraph model for random time dependent shortest paths
- Algorithms for time-dependent bicriteria shortest path problems
- Multicriteria adaptive paths in stochastic, time-varying networks
- The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriterion shortest hyperpaths in random time-dependent networks
- A polynomial-time algorithm to find shortest paths with recourse
This page was built for publication: Bicriterion Shortest Paths in Stochastic Time-Dependent Networks