Pages that link to "Item:Q4136979"

The following pages link to Deterministic network optimization: A bibliography (Q4136979):

Displaying 34 items.

• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← 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)
• The quickest path problem (Q912765) (← links)
• An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
• A survey of dynamic network flows (Q917417) (← 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)
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation (Q1060958) (← links)
• The hierarchical network design problem (Q1083378) (← links)
• The impact of distance on location problems (Q1142684) (← links)
• A new algorithm to find the shortest paths between all pairs of nodes (Q1157967) (← links)
• Bicriteria network flow problems: Continuous case (Q1175771) (← links)
• On the quickest path problem (Q1261485) (← links)
• Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS (Q1265848) (← links)
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths (Q1318506) (← links)
• Minimum time paths in a network with mixed time constraints. (Q1406690) (← links)
• Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096) (← links)
• Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network (Q1870808) (← links)
• Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
• Intelligent transportation systems -- Enabling technologies (Q1906952) (← 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)
• The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
• System Reliability Assessment through<i>p</i>Minimal Paths in Stochastic Case with Backup-routing (Q2815376) (← links)
• Reliability evaluation of a multistate network subject to time constraint under routing policy (Q2872616) (← links)
• ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET (Q2911992) (← links)
• Approximating the Stochastic Network by its <i>M</i> Shortest Paths (Q3415944) (← links)
• Analyse und Synthese zuverlässiger Netze (Q4196224) (← links)
• The determination of the path with minimum-cost norm value (Q4419275) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• (Q4999379) (← links)
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem (Q5931724) (← links)