On the public citation graph

Deterministic network optimization: A bibliography

0 signed · 91 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471667196.ess1773openalex-snapshot
Network Analysis
inferred← citeshttps://doi.org/10.1002/0471667196.ess1773.pub2openalex-snapshot
Network Analysis
inferred← citeshttps://doi.org/10.1002/0471667196.ess1773.pub3openalex-snapshot
Network Analysis
inferred← citeshttps://doi.org/10.1002/9780471703778.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118033173.ch1openalex-snapshot
Netform Origins and Uses: Why Modeling and Netforms are Important
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02300openalex-snapshot
Network Analysis
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1982.tb04325.xopenalex-snapshot
A Primal Algorithm for Finding Minimum-Cost Flows in Capacitated Networks With Applications
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.10077openalex-snapshot
The determination of the path with minimum‐cost norm value
inferred← citeshttps://doi.org/10.1002/net.21920openalex-snapshot
Networks in economics and finance in Networks and beyond: A half century retrospective
inferred← citeshttps://doi.org/10.1002/net.3230110209openalex-snapshot
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
inferred← citeshttps://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferred← citeshttps://doi.org/10.1002/sys.20196openalex-snapshot
Evaluation of system reliability for a cloud computing system with imperfect nodes
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_25openalex-snapshot
A birds eye view to path problems
inferred← citeshttps://doi.org/10.1007/978-3-642-24918-1_17openalex-snapshot
Reliability-Based Route Optimization of a Transportation Network with Random Arc Capacities and Time Threshold
inferred← citeshttps://doi.org/10.1007/978-3-642-46854-4_14openalex-snapshot
Characteristics of the Efficient Solutions of Bicriteria and Tricriteria Network Flow Problems
inferred← citeshttps://doi.org/10.1007/978-3-658-09267-2_6openalex-snapshot
Tourenplanung
inferred← citeshttps://doi.org/10.1007/978-3-8349-6927-9_6openalex-snapshot
Tourenplanung
inferred← citeshttps://doi.org/10.1007/bf01954689openalex-snapshot
Analyse und Synthese zuverlässiger Netze
inferred← citeshttps://doi.org/10.1007/bf02216922openalex-snapshot
A survey of dynamic network flows
inferred← citeshttps://doi.org/10.1007/bfb0083472openalex-snapshot
Topological network synthesis
inferred← citeshttps://doi.org/10.1007/bfb0121088openalex-snapshot
On a nonbasic dual method for the transportation problem
inferred← citeshttps://doi.org/10.1007/s11135-011-9613-zopenalex-snapshot
Performance indicator evaluation for a cloud computing system from QoS viewpoint
inferred← citeshttps://doi.org/10.1007/s11518-011-5161-2openalex-snapshot
Estimated and exact system reliabilities of a maintainable computer network
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90057-gopenalex-snapshot
On the quickest path problem
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90039-aopenalex-snapshot
The quickest path problem
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90042-6openalex-snapshot
An interactive approach to identify the best compromise solution for two objective shortest path problems
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90045-0openalex-snapshot
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
inferred← citeshttps://doi.org/10.1016/0377-2217(80)90110-1openalex-snapshot
The impact of distance on location problems
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90030-xopenalex-snapshot
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90180-3openalex-snapshot
Multiobjective design of transportation networks: Taxonomy and annotation
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90151-kopenalex-snapshot
Bicriteria network flow problems: Continuous case
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00127-nopenalex-snapshot
Intelligent transportation systems—Enabling technologies
inferred← citeshttps://doi.org/10.1016/b978-0-08-021295-1.50020-1openalex-snapshot
MODELING AND OPTIMIZATION FOR TRANSPORTATION SYSTEMS PLANNING AND OPERATIONS**Supported in part by U.S. Department of Transportation (Contract DOT-TSC-1058), Transportation Advanced Research Program (TARP).
inferred← citeshttps://doi.org/10.1016/j.amc.2012.10.024openalex-snapshot
Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
inferred← citeshttps://doi.org/10.1016/j.apm.2009.04.002openalex-snapshot
On transmission time through k minimal paths of a capacitated-flow network
inferred← citeshttps://doi.org/10.1016/j.apm.2010.09.020openalex-snapshot
Spare routing problem with p minimal paths for time-based stochastic flow networks
inferred← citeshttps://doi.org/10.1016/j.cam.2008.09.003openalex-snapshot
Time version of the shortest path problem in a stochastic-flow network
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.08.026openalex-snapshot
System reliability for quickest path problems under time threshold and budget
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.08.002openalex-snapshot
Stochastic flow networks via multiple paths under time threshold and budget constraint
inferred← citeshttps://doi.org/10.1016/j.cie.2008.09.002openalex-snapshot
Optimal routing policy of a stochastic-flow network
inferred← citeshttps://doi.org/10.1016/j.cie.2011.07.005openalex-snapshot
Transmission reliability of k minimal paths within time threshold
inferred← citeshttps://doi.org/10.1016/j.cor.2003.08.004openalex-snapshot
Finding K shortest looping paths in a traffic-light network
inferred← citeshttps://doi.org/10.1016/j.cor.2010.02.005openalex-snapshot
Finding the K shortest paths in a schedule-based transit network
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.12.006openalex-snapshot
Calculation of minimal capacity vectors through k minimal paths under budget and time constraints
inferred← citeshttps://doi.org/10.1016/j.eswa.2008.07.080openalex-snapshot
Routing policy of stochastic-flow networks under time threshold and budget constraint
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.04.230openalex-snapshot
Maintenance reliability estimation for a cloud computing network with nodes failure
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.07.075openalex-snapshot
A method to evaluate the routing policy with two minimal paths within time threshold
inferred← citeshttps://doi.org/10.1016/j.ijpe.2009.11.033openalex-snapshot
System reliability of a stochastic-flow network through two minimal paths under time threshold
inferred← citeshttps://doi.org/10.1016/j.ijpe.2012.05.028openalex-snapshot
Approximate and accurate maintenance reliabilities of a cloud computing network with nodes failure subject to budget
inferred← citeshttps://doi.org/10.1016/j.ins.2012.03.016openalex-snapshot
On performance evaluation for a multistate network under spare routing
inferred← citeshttps://doi.org/10.1016/j.mcm.2005.01.004openalex-snapshot
The first K shortest unique-arc walks in a traffic-light network
inferred← citeshttps://doi.org/10.1016/j.simpat.2012.07.008openalex-snapshot
System reliability for a multistate flow network with multiple joint minimal paths under time constraint
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00193-5openalex-snapshot
Distributed algorithms for the constrained routing problem in computer networks
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70357-1openalex-snapshot
Selected Families of Location Problems
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70437-0openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0191-2615(99)00023-5openalex-snapshot
Shortest paths in traffic-light networks
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00025-4openalex-snapshot
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00027-0openalex-snapshot
Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00020-3openalex-snapshot
Minimum time paths in a network with mixed time constraints
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00148-0openalex-snapshot
Minimization of travel time and weighted number of stops in a traffic-light network
inferred← citeshttps://doi.org/10.1016/s0377-2217(86)80007-8openalex-snapshot
The hierarchical network design problem
inferred← citeshttps://doi.org/10.1016/s0893-9659(00)00099-9openalex-snapshot
A simplification of the double-sweep algorithm to solve the k-shortest path problem
inferred← citeshttps://doi.org/10.1016/s0969-6016(98)00028-8openalex-snapshot
Operations research and semantic control: application to advanced traffic management
inferred← citeshttps://doi.org/10.1017/s0269964800001297openalex-snapshot
Approximating the Stochastic Network by its M Shortest Paths
inferred← citeshttps://doi.org/10.1080/00207721.2012.659684openalex-snapshot
Reliability evaluation of a multistate network subject to time constraint under routing policy
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1080/02533839.2012.655530openalex-snapshot
Estimated system reliability of a cloud computing network subject to maintenance budget
inferred← citeshttps://doi.org/10.1080/02533839.2012.747250openalex-snapshot
System reliability for joint minimal paths under time constraint
inferred← citeshttps://doi.org/10.1080/03610926.2012.665551openalex-snapshot
System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing
inferred← citeshttps://doi.org/10.1080/10170660903533812openalex-snapshot
The stochastic quickest path problem via minimal paths
inferred← citeshttps://doi.org/10.1109/icccn.1998.998796openalex-snapshot
Distributed algorithms for the constrained quickest routing problem in multimedia communications
inferred← citeshttps://doi.org/10.1109/icrms.2011.5979267openalex-snapshot
Reliability evaluation of a multistate network under routing policy
inferred← citeshttps://doi.org/10.1109/ivs.1995.528320openalex-snapshot
A semantic control approach to intelligent transportation systems
inferred← citeshttps://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/picmet.1991.183650openalex-snapshot
A multiobjective approach to transportation network design
inferred← citeshttps://doi.org/10.1109/tcom.1981.1094884openalex-snapshot
A Note on the Complexity of the Star-Star Concentrator Problem
inferred← citeshttps://doi.org/10.1109/tr.2009.2035794openalex-snapshot
Reliability of $k$ Separate Minimal Paths Under Both Time and Budget Constraints
inferred← citeshttps://doi.org/10.1109/tr.2010.2040765openalex-snapshot
Spare Routing Reliability for a Stochastic Flow Network Through Two Minimal Paths Under Budget Constraint
inferred← citeshttps://doi.org/10.1109/tr.2010.2103594openalex-snapshot
Network Reliability of a Time-Based Multistate Network Under Spare Routing With $p$ Minimal Paths
inferred← citeshttps://doi.org/10.1109/tsmc.1980.4308481openalex-snapshot
Dynamic Decisions and Work Load in Multitask Supervisory Control
inferred← citeshttps://doi.org/10.1109/tsmca.2009.2013193openalex-snapshot
Optimal Pair of Minimal Paths Under Both Time and Budget Constraints
inferred← citeshttps://doi.org/10.1111/j.1467-9787.1984.tb01030.xopenalex-snapshot
SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER
inferred← citeshttps://doi.org/10.1142/s0217595912400210openalex-snapshot
ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET
inferred← citeshttps://doi.org/10.1287/moor.16.4.859openalex-snapshot
Relaxation Method for Large Scale Linear Programming Using Decomposition
inferred← citeshttps://doi.org/10.1287/trsc.23.3.208openalex-snapshot
The Covering Salesman Problem
inferred← citeshttps://doi.org/10.13052/jwe1540-9589.20213openalex-snapshot
Design and Analysis of Low Delay Deterministic Network Based on Data Mining Association Analysis
inferred← citeshttps://doi.org/10.21236/ada052777openalex-snapshot
Basic Studies in Combinatorial and Nondifferentiable Optimization.
inferred← citeshttps://doi.org/10.23940/ijpe.15.5.p417.magopenalex-snapshot
Performability of a Stochastic-Flow Information Network Considering Maintenance
inferred← citeshttps://doi.org/10.31274/rtd-180813-8839openalex-snapshot
Painted network flows with weighted divergence
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.