Pages that link to "Item:Q1886505"
From MaRDI portal
The following pages link to A label-setting algorithm for finding a quickest path (Q1886505):
Displaying 31 items.
- Fast and fine quickest path algorithm (Q296816) (← links)
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate (Q331848) (← 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)
- 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)
- 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)
- Inverse quickest center location problem on a tree (Q1741512) (← links)
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks (Q1750473) (← links)
- Approximate path searching method for single-satellite observation and transmission task planning problem (Q1993086) (← links)
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles (Q2005853) (← links)
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks (Q2108154) (← links)
- Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
- Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints (Q2178318) (← links)
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget (Q2344678) (← links)
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538) (← 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)
- ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET (Q2911992) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint (Q4960684) (← 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)
