Bicriteria shortest path in networks of queues
DOI10.1016/J.AMC.2006.04.004zbMATH Open1109.60072OpenAlexW2000570910MaRDI QIDQ861124FDOQ861124
Authors: Amir Azaron 
Publication date: 9 January 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.004
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized dynamic programming for multicriteria optimization
- On a multicriteria shortest path problem
- Distribution function of the shortest path in networks of queues
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Title not available (Why is that?)
- A multi-objective resource allocation problem in dynamic PERT networks
- Bicriteria network flow problems: Continuous case
- Multiobjective routing of hazardous materials in stochastic networks
Cited In (4)
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
- Title not available (Why is that?)
- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length
- A new probabilistic approach to the path criticality in stochastic PERT
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)
