Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
From MaRDI portal
Publication:2379538
DOI10.1016/j.ejor.2008.12.006zbMath1188.90055OpenAlexW2047112290MaRDI QIDQ2379538
Publication date: 19 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.006
Related Items (7)
An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures ⋮ Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations
Cites Work
- Unnamed Item
- Unnamed Item
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Distributed algorithms for the quickest path problem
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- A label-setting algorithm for finding a quickest path
- An algorithm for ranking quickest simple paths
- The all-pairs quickest path problem
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Evolution of random graph processes with degree constraints
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Deterministic network optimization: A bibliography
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
This page was built for publication: Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
