Pages that link to "Item:Q1322119"
From MaRDI portal
The following pages link to Finding the \(k\) quickest simple paths in a network (Q1322119):
Displaying 38 items.
- Fast and fine quickest path algorithm (Q296816) (← links)
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (Q342541) (← links)
- Algorithms for the quickest path problem and the reliable quickest path problem (Q373197) (← links)
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network (Q506140) (← links)
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← links)
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case (Q621591) (← links)
- System reliability for quickest path problems under time threshold and budget (Q623173) (← links)
- Stochastic flow networks via multiple paths under time threshold and budget constraint (Q660929) (← links)
- Internet packet routing: application of a \(K\)-quickest path algorithm (Q877587) (← links)
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599) (← links)
- On transmission time through \(k\) minimal paths of a capacitated-flow network (Q967798) (← links)
- Time version of the shortest path problem in a stochastic-flow network (Q1019780) (← links)
- Reliability based assignment in stochastic-flow freight network (Q1021491) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold (Q1671718) (← links)
- The energy-constrained quickest path problem (Q1676484) (← links)
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network (Q1870808) (← links)
- A label-setting algorithm for finding a quickest path (Q1886505) (← links)
- An algorithm for ranking quickest simple paths (Q1886854) (← links)
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation (Q2150813) (← links)
- Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints (Q2178318) (← links)
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538) (← links)
- A comprehensive survey on the quickest path problem (Q2379862) (← links)
- Fast data transmission and maximal dynamic flow. (Q2583548) (← links)
- System Reliability Assessment through<i>p</i>Minimal Paths in Stochastic Case with Backup-routing (Q2815376) (← links)
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints (Q2852104) (← links)
- Reliability evaluation of a multistate network subject to time constraint under routing policy (Q2872616) (← links)
- Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations (Q2876110) (← links)
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets (Q3148373) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks (Q4578177) (← links)
- Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint (Q4960684) (← links)
- Finding the k shortest paths in parallel (Q5048947) (← links)
- A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451) (← links)
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks (Q5220004) (← links)
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability (Q5252893) (← links)
- Min‐Max quickest path problems (Q5326774) (← links)
