Deterministic network optimization: A bibliography
From MaRDI portal
Publication:4136979
DOI10.1002/net.3230070204zbMath0362.90116OpenAlexW1991225280MaRDI QIDQ4136979
Bruce L. Golden, Thomas L. Magnanti
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5181
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
The hierarchical network design problem, Finding \(K\) shortest looping paths in a traffic-light network, Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints, ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET, Intelligent transportation systems -- Enabling technologies, The impact of distance on location problems, System reliability for quickest path problems under time threshold and budget, Unnamed Item, Minimum time paths in a network with mixed time constraints., A new algorithm to find the shortest paths between all pairs of nodes, The quickest path problem, An interactive approach to identify the best compromise solution for two objective shortest path problems, A survey of dynamic network flows, Bicriteria network flow problems: Continuous case, Stochastic flow networks via multiple paths under time threshold and budget constraint, Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks, Finding the \(K\) shortest paths in a schedule-based transit network, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, On transmission time through \(k\) minimal paths of a capacitated-flow network, The first \(K\) shortest unique-arc walks in a traffic-light network, The determination of the path with minimum-cost norm value, On the quickest path problem, System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing, Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS, Time version of the shortest path problem in a stochastic-flow network, Analyse und Synthese zuverlässiger Netze, Approximating the Stochastic Network by its M Shortest Paths, The maximum covering/shortest path problem: A multiobjective network design and routing formulation, Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Reliability evaluation of a multistate network subject to time constraint under routing policy, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Minimization of travel time and weighted number of stops in a traffic-light network, Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
