Bicriteria shortest path in networks of queues
From MaRDI portal
Publication:861124
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4076264 (Why is no real title available?)
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- A multi-objective resource allocation problem in dynamic PERT networks
- Bicriteria network flow problems: Continuous case
- Distribution function of the shortest path in networks of queues
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Generalized dynamic programming for multicriteria optimization
- Multiobjective routing of hazardous materials in stochastic networks
- On a multicriteria shortest path problem
Cited in
(4)- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
- scientific article; zbMATH DE number 1936537 (Why is no real title available?)
- A new probabilistic approach to the path criticality in stochastic PERT
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
This page was built for publication: Bicriteria shortest path in networks of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861124)