Deterministic network optimization: A bibliography

Cited In (34)

Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
Minimization of travel time and weighted number of stops in a traffic-light network
Reliability evaluation of a multistate network subject to time constraint under routing policy
Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
Approximating the Stochastic Network by its M Shortest Paths
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
Bicriteria network flow problems: Continuous case
Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
Intelligent transportation systems -- Enabling technologies
The first \(K\) shortest unique-arc walks in a traffic-light network
The quickest path problem
Finding the \(K\) shortest paths in a schedule-based transit network
The determination of the path with minimum-cost norm value
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
The hierarchical network design problem
A new algorithm to find the shortest paths between all pairs of nodes
On the quickest path problem
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Title not available (Why is that?)
System reliability for quickest path problems under time threshold and budget
System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
The impact of distance on location problems
An interactive approach to identify the best compromise solution for two objective shortest path problems
A survey of dynamic network flows
Time version of the shortest path problem in a stochastic-flow network
Minimum time paths in a network with mixed time constraints.
Analyse und Synthese zuverlässiger Netze
On transmission time through \(k\) minimal paths of a capacitated-flow network
Stochastic flow networks via multiple paths under time threshold and budget constraint
Finding \(K\) shortest looping paths in a traffic-light network

This page was built for publication: Deterministic network optimization: A bibliography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136979)