On the public citation graph
Implementation and efficiency of Moore-algorithms for the shortest route problem
0 signed · 197 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02253338openalex-snapshot
Netzwerk-Veränderungen und Korrektur kürzester Weglängen von einer Wurzelmenge zu allen anderen Knoten
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.1287/opre.8.2.224openalex-snapshot
Solutions of the Shortest-Route Problem—A Review
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(199812)45:8<769::aid-nav2>3.0.co;2-#openalex-snapshot
Iterative methods for dynamic stochastic shortest path problems
inferred← citeshttps://doi.org/10.1002/1097-0037(200101)37:1<35::aid-net4>3.0.co;2-gopenalex-snapshot
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
inferred← citeshttps://doi.org/10.1002/1520-6750(199304)40:3<305::aid-nav3220400303>3.0.co;2-4openalex-snapshot
Dual-ascent methods for large-scale multicommodity flow problems
inferred← citeshttps://doi.org/10.1002/9783527622771.ch4openalex-snapshot
Planning Large Supply Chain Scenarios with “Quant‐based Combinatorial Optimization”
inferred← citeshttps://doi.org/10.1002/atr.177openalex-snapshot
Distributed computing approaches for large‐scale probit‐based stochastic user equilibrium problems
inferred← citeshttps://doi.org/10.1002/ecjc.4430760803openalex-snapshot
A class of fixed‐point problems on graphs and iterative solution algorithms
inferred← citeshttps://doi.org/10.1002/net.20077openalex-snapshot
Near-shortest and K-shortest simple paths
inferred← citeshttps://doi.org/10.1002/net.20131openalex-snapshot
The shortest path problem on large‐scale real‐road networks
inferred← citeshttps://doi.org/10.1002/net.20247openalex-snapshot
Lagrangian relaxation and enumeration for solving constrained shortest‐path problems
inferred← citeshttps://doi.org/10.1002/net.21870openalex-snapshot
A new algorithm for the shortest‐path problem
inferred← citeshttps://doi.org/10.1002/net.21905openalex-snapshot
Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
inferred← citeshttps://doi.org/10.1002/net.3230080203openalex-snapshot
A mean‐time comparison of algorithms for the all‐pairs shortest‐path problem with arbitrary arc lengths
inferred← citeshttps://doi.org/10.1002/net.3230090303openalex-snapshot
On algorithms for finding the k shortest paths in a network
inferred← citeshttps://doi.org/10.1002/net.3230090304openalex-snapshot
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
inferred← citeshttps://doi.org/10.1002/net.3230110406openalex-snapshot
A dual simplex algorithm for finding all shortest paths
inferred← citeshttps://doi.org/10.1002/net.3230120207openalex-snapshot
A decomposition algorithm for locating a shortest path between two nodes in a network
inferred← citeshttps://doi.org/10.1002/net.3230140103openalex-snapshot
Computational study of an improved shortest path algorithm
inferred← citeshttps://doi.org/10.1002/net.3230140206openalex-snapshot
Shortest‐path methods: Complexity, interrelations and new propositions
inferred← citeshttps://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferred← citeshttps://doi.org/10.1002/net.3230200202openalex-snapshot
The stochastic multicommodity flow problem
inferred← citeshttps://doi.org/10.1002/net.3230230808openalex-snapshot
A simple and fast label correcting algorithm for shortest paths
inferred← citeshttps://doi.org/10.1007/0-306-48220-7_1openalex-snapshot
Origin-based Network Assignment
inferred← citeshttps://doi.org/10.1007/11750321_16openalex-snapshot
Analyzing Chain Programs over Difference Constraints
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_1openalex-snapshot
Selecting Problems for Algorithm Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_1openalex-snapshot
Sparser: A paradigm for running distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_67openalex-snapshot
Negative-cycle detection algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-39934-8_10openalex-snapshot
Label-Correcting Shortest Path Algorithms Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_8openalex-snapshot
Guided Search for the Shortest Path on Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-5757-9_11openalex-snapshot
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_773-1openalex-snapshot
Reoptimizing Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_22openalex-snapshot
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_15openalex-snapshot
Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets
inferred← citeshttps://doi.org/10.1007/978-3-642-79641-8_12openalex-snapshot
An Algorithm for Extremals Calculation in Optimal Control Problems with Applications to the Dynamic Traffic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-95316-3_2openalex-snapshot
Optimierungsprobleme mit Polynomial Begrenzten Algorithmen (P-Probleme)
inferred← citeshttps://doi.org/10.1007/978-3-642-95406-1_19openalex-snapshot
In Pursuit of a Methodology for Testing Mathematical Programming Software
inferred← citeshttps://doi.org/10.1007/978-3-642-99748-8_16openalex-snapshot
Graphentheoretische Probleme und Methoden — ein Überblick über neuere Entwicklungen (Übersichtsvortrag)
inferred← citeshttps://doi.org/10.1007/978-94-007-4722-7_46openalex-snapshot
Labeling Methods for the General Case of the Multi-objective Shortest Path Problem – A Computational Study
inferred← citeshttps://doi.org/10.1007/bf01069971openalex-snapshot
A local algorithm for the shortest path problem with a single source
inferred← citeshttps://doi.org/10.1007/bf01408019openalex-snapshot
Greedy partitioned algorithms for the shortest-path problem
inferred← citeshttps://doi.org/10.1007/bf02032386openalex-snapshot
Robust vehicle routing DSS and road networks on a European scale?
inferred← citeshttps://doi.org/10.1007/bf02192173openalex-snapshot
Parallel asynchronous label-correcting methods for shortest paths
inferred← citeshttps://doi.org/10.1007/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferred← citeshttps://doi.org/10.1007/s00236-025-00511-0openalex-snapshot
An efficient alternative strategy for finding prices in envy-free perfect matchings
inferred← citeshttps://doi.org/10.1007/s10589-010-9323-9openalex-snapshot
An efficient label setting/correcting shortest path algorithm
inferred← citeshttps://doi.org/10.1007/s10707-015-0229-7openalex-snapshot
SPLZ: An efficient algorithm for single source shortest path problem using compression method
inferred← citeshttps://doi.org/10.1016/0041-1647(78)90102-8openalex-snapshot
Improved shortest path algorithms for transport networks
inferred← citeshttps://doi.org/10.1016/0096-3003(93)90060-ropenalex-snapshot
Routing with nonlinear multiattribute cost functions
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80014-3openalex-snapshot
Application of graph theory to process design and analysis
inferred← citeshttps://doi.org/10.1016/0166-218x(82)90031-2openalex-snapshot
A new algorithm to find the shortest paths between all pairs of nodes
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90081-8openalex-snapshot
Microcomputer-based algorithms for large scale shortest path problems
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90082-xopenalex-snapshot
A new variant of the partitioning shortest path algorithm
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90017-4openalex-snapshot
A note on the partitioning shortest path algorithm
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90088-7openalex-snapshot
On the equivalence between some shortest path algorithms
inferred← citeshttps://doi.org/10.1016/0191-2607(81)90083-2openalex-snapshot
Rail freight traffic assignment
inferred← citeshttps://doi.org/10.1016/0191-2615(80)90014-4openalex-snapshot
Shortest path forest with topological ordering: An algorithm description in SDL
inferred← citeshttps://doi.org/10.1016/0191-2615(96)00001-xopenalex-snapshot
A note on least time path computation considering delays and prohibitions for intersection movements
inferred← citeshttps://doi.org/10.1016/0305-0548(81)90015-0openalex-snapshot
A computational study of Floyd's algorithm
inferred← citeshttps://doi.org/10.1016/0305-0548(81)90035-6openalex-snapshot
Current and future research directions in network optimization
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(91)90014-iopenalex-snapshot
Shortest path algorithms: A computational study with the C programming language
inferred← citeshttps://doi.org/10.1016/0377-2217(79)90047-xopenalex-snapshot
An evaluation of mathematical programming and minicomputers
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90215-4openalex-snapshot
An empirical investigation of some bicriterion shortest path algorithms
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90022-fopenalex-snapshot
A heuristic improvement of the Bellman-Ford algorithm
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50011-6openalex-snapshot
Practical use of Bucketing Techniques in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-85-352-7814-9.50009-9openalex-snapshot
Problemas de Conexão: Árvores, Caminhos e Emparelhamento
inferred← citeshttps://doi.org/10.1016/j.amc.2005.04.005openalex-snapshot
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
inferred← citeshttps://doi.org/10.1016/j.autcon.2021.103697openalex-snapshot
Comparison of different algorithms for time analysis for CPM schedule networks
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.01.036openalex-snapshot
A new approximation algorithm for obtaining the probability distribution function for project completion time
inferred← citeshttps://doi.org/10.1016/j.cie.2014.02.013openalex-snapshot
Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles
inferred← citeshttps://doi.org/10.1016/j.cor.2005.03.027openalex-snapshot
Heuristic shortest path algorithms for transportation applications: State of the art
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.003openalex-snapshot
Multicriteria adaptive paths in stochastic, time-varying networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.08.018openalex-snapshot
An extension of labeling techniques for finding shortest path trees
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.010openalex-snapshot
Shortest path problem with forbidden paths: The elementary version
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.10.044openalex-snapshot
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.019openalex-snapshot
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123311openalex-snapshot
Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay
inferred← citeshttps://doi.org/10.1016/j.foreco.2023.121265openalex-snapshot
Integrated planning of forest exploration infrastructures in an amazonian sustainable forest management area
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.005openalex-snapshot
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
inferred← citeshttps://doi.org/10.1016/j.jenvman.2021.112332openalex-snapshot
Optimizing forest road planning in a sustainable forest management area in the Brazilian Amazon
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.003openalex-snapshot
Parallel implementation of a transportation network model
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.05.033openalex-snapshot
A Path-size Weibit Stochastic User Equilibrium Model
inferred← citeshttps://doi.org/10.1016/j.trb.2005.12.002openalex-snapshot
An efficient algorithm for building min-path trees for all origins in a multi-class network
inferred← citeshttps://doi.org/10.1016/j.trb.2009.02.007openalex-snapshot
Norm approximation method for handling traffic count inconsistencies in path flow estimator
inferred← citeshttps://doi.org/10.1016/j.trb.2013.06.001openalex-snapshot
A path-size weibit stochastic user equilibrium model
inferred← citeshttps://doi.org/10.1016/j.trc.2019.05.020openalex-snapshot
A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104556openalex-snapshot
Dynamic vehicle relocation and assignment for an intelligent vehicle platooning transit system
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00105-3openalex-snapshot
Implementing parallel shortest path for parallel transportation applications
inferred← citeshttps://doi.org/10.1016/s0191-2615(00)00019-9openalex-snapshot
An adaptive routing algorithm for in-vehicle route guidance systems with real-time information
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00046-4openalex-snapshot
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00027-6openalex-snapshot
Least possible time paths in stochastic,time-varying networks
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1016/s0927-5452(04)80040-6openalex-snapshot
Distributed negative cycle detection algorithms
inferred← citeshttps://doi.org/10.1016/s0927-5452(06)80020-1openalex-snapshot
Parallel Shortest Paths Methods for Globally Optimal Trajectories
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43876-6openalex-snapshot
A New Algorithm for Shortest Paths in Discrete Dynamic Networks
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80524-3openalex-snapshot
Routing in Very Large Multi-Modal Time Dependent Networks
inferred← citeshttps://doi.org/10.1017/s0890060400002675openalex-snapshot
Searching time-table networks
inferred← citeshttps://doi.org/10.1023/a:1025750631443openalex-snapshot
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept
inferred← citeshttps://doi.org/10.1023/a:1027348026919openalex-snapshot
Mathematical Modeling of Traffic Flows
inferred← citeshttps://doi.org/10.1023/b:jmma.0000026675.50719.ceopenalex-snapshot
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management
inferred← citeshttps://doi.org/10.1049/iet-its.2009.0100openalex-snapshot
Route planning and user interface for an advanced intelligent transport system
inferred← citeshttps://doi.org/10.1051/matecconf/20166305027openalex-snapshot
The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load
inferred← citeshttps://doi.org/10.1057/jors.1977.57openalex-snapshot
Minimum Paths in Directed Graphs
inferred← citeshttps://doi.org/10.1061/(asce)0733-947x(1987)113:4(450)openalex-snapshot
XNET: Extended Traffic Assignment Model
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000675openalex-snapshot
Bounding Box Approach to Network Pruning for Efficient Path Search through Large Networks
inferred← citeshttps://doi.org/10.1061/41039(345)393openalex-snapshot
An Effective Approach to Treating with Unrealistic Paths in Multi-Modal Traffic Assignment
inferred← citeshttps://doi.org/10.1080/03081068808717360openalex-snapshot
Recent developments in path finding algorithms: a review
inferred← citeshttps://doi.org/10.1080/03155986.1982.11731878openalex-snapshot
Recent Developments in Computer Implementation Technology for Network Flow Algorithms
inferred← citeshttps://doi.org/10.1080/10170660709509030openalex-snapshot
A LABEL-CORRECTING TRACING ALGORITHM FOR THE APPROXIMATION OF THE PROBABILITY DISTRIBUTION FUNCTION OF THE PROJECT COMPLETION TIME
inferred← citeshttps://doi.org/10.1080/18128602.2012.669415openalex-snapshot
Adjustment of the link travel-time functions in traffic equilibrium assignment models
inferred← citeshttps://doi.org/10.1080/23249935.2020.1720041openalex-snapshot
A parallel computing framework for solving user equilibrium problem on computer clusters
inferred← citeshttps://doi.org/10.1088/1757-899x/1218/1/012043openalex-snapshot
Project scheduling algorithms for construction projects with stretchable activities
inferred← citeshttps://doi.org/10.1109/18.490504openalex-snapshot
Optimal sectionalization of a trellis
inferred← citeshttps://doi.org/10.1109/43.67788openalex-snapshot
Switch-level simulation using dynamic graph algorithms
inferred← citeshttps://doi.org/10.1109/cso.2009.269openalex-snapshot
A Turn-Based Algorithm for Solving the Logit Type Network Loading Problem
inferred← citeshttps://doi.org/10.1109/dac.1988.14807openalex-snapshot
A dynamically-directed switch model for MOS logic simulation
inferred← citeshttps://doi.org/10.1109/dcs.1988.12538openalex-snapshot
Critical path analysis for the execution of parallel and distributed programs
inferred← citeshttps://doi.org/10.1109/glocom.1990.116531openalex-snapshot
Performance comparison of routing algorithms in packet switched networks
inferred← citeshttps://doi.org/10.1109/icde.1992.213212openalex-snapshot
I/O-efficiency of shortest path algorithms: an analysis
inferred← citeshttps://doi.org/10.1109/icip.1994.413853openalex-snapshot
Extracting curvilinear features from remotely sensed images using minimum cost path techniques
inferred← citeshttps://doi.org/10.1109/icise.2009.279openalex-snapshot
An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks
inferred← citeshttps://doi.org/10.1109/icsmc.1994.400096openalex-snapshot
Path search techniques for transportation networks with time-dependent, stochastic arc costs
inferred← citeshttps://doi.org/10.1109/icsmc.2012.6377906openalex-snapshot
Multi-level operational C2 architecture modeling via hierarchically structured semi-Markov decision processes
inferred← citeshttps://doi.org/10.1109/icton.2016.7550605openalex-snapshot
Reoptimizing shortest paths: From state of the art to new recent perspectives
inferred← citeshttps://doi.org/10.1109/itsc.2007.4357802openalex-snapshot
Improvement of a Shortest Routes Algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2015.2485994openalex-snapshot
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures
inferred← citeshttps://doi.org/10.1109/tsusc.2025.3632842openalex-snapshot
Improving Energy Efficiency of Graph Processing on Shared-Memory Systems
inferred← citeshttps://doi.org/10.1109/upcon.2018.8597076openalex-snapshot
Recognition of Bangla Handwritten Characters using Feature Combinations
inferred← citeshttps://doi.org/10.1137/070698774openalex-snapshot
A Practical Shortest Path Algorithm with Linear Expected Time
inferred← citeshttps://doi.org/10.1137/0801026openalex-snapshot
An Auction Algorithm for Shortest Paths
inferred← citeshttps://doi.org/10.1137/10080909xopenalex-snapshot
Fast Two-scale Methods for Eikonal Equations
inferred← citeshttps://doi.org/10.1137/1033048openalex-snapshot
Some Recent Advances in Network Flows
inferred← citeshttps://doi.org/10.1145/1498698.1537602openalex-snapshot
Shortest-path feasibility algorithms
inferred← citeshttps://doi.org/10.1145/1570499.1570501openalex-snapshot
An architecture for routing in the ISO connectionless internet
inferred← citeshttps://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferred← citeshttps://doi.org/10.1145/347792.347814openalex-snapshot
A computational study of routing algorithms for realistic transportation networks
inferred← citeshttps://doi.org/10.1177/03611981221143116openalex-snapshot
Optimization for the Multiday Urban Personalized Trip Design Problem With Time Windows and Transportation Mode Recommendations
inferred← citeshttps://doi.org/10.1177/0361198196153700115openalex-snapshot
Computational Study of a Path-Based Algorithm and Its Variants for Static Traffic Assignment
inferred← citeshttps://doi.org/10.1201/9781315368986-8openalex-snapshot
Time-dependent Shortest Hyperpaths for Dynamic Routing on Transit Networks
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0873openalex-snapshot
Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
inferred← citeshttps://doi.org/10.1287/mnsc.28.12.1380openalex-snapshot
Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem
inferred← citeshttps://doi.org/10.1287/mnsc.31.9.1106openalex-snapshot
New Polynomial Shortest Path Algorithms and Their Computational Attributes
inferred← citeshttps://doi.org/10.1287/moor.2023.0362openalex-snapshot
Monotone Causality in Opportunistically Stochastic Shortest Path Problems
inferred← citeshttps://doi.org/10.1287/opre.24.6.1164openalex-snapshot
Technical Note—Shortest-Path Algorithms: A Comparison
inferred← citeshttps://doi.org/10.1287/opre.27.1.161openalex-snapshot
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
inferred← citeshttps://doi.org/10.1287/opre.33.1.65openalex-snapshot
A New Polynomially Bounded Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1287/opre.48.2.318.12378openalex-snapshot
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1287/trsc.1040.0112openalex-snapshot
Updating Paths in Time-Varying Networks Given Arc Weight Changes
inferred← citeshttps://doi.org/10.1287/trsc.1050.0124openalex-snapshot
A Multiple Pairs Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1287/trsc.19.1.75openalex-snapshot
Path Preferences and Optimal Paths in Probabilistic Networks
inferred← citeshttps://doi.org/10.1287/trsc.2016.0693openalex-snapshot
Demand-Oriented Integrated Scheduling for Point-to-Point Airlines
inferred← citeshttps://doi.org/10.1287/trsc.21.3.133openalex-snapshot
Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
inferred← citeshttps://doi.org/10.1287/trsc.27.2.102openalex-snapshot
A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
inferred← citeshttps://doi.org/10.1287/trsc.28.4.292openalex-snapshot
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
inferred← citeshttps://doi.org/10.1287/trsc.32.1.65openalex-snapshot
Shortest Path Algorithms: An Evaluation Using Real Road Networks
inferred← citeshttps://doi.org/10.1287/trsc.34.2.198.12304openalex-snapshot
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
inferred← citeshttps://doi.org/10.1287/trsc.36.4.398.549openalex-snapshot
Origin-Based Algorithm for the Traffic Assignment Problem
inferred← citeshttps://doi.org/10.13021/mars/4533openalex-snapshot
Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding
inferred← citeshttps://doi.org/10.13140/rg.2.2.25001.31842openalex-snapshot
Real time image processing : algorithm parallelization on multicore multithread architecture
inferred← citeshttps://doi.org/10.15407/csc.2022.01.024openalex-snapshot
The Problem of Graphs Local Optimization and its Applications
inferred← citeshttps://doi.org/10.15807/jorsj.27.43openalex-snapshot
PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM
inferred← citeshttps://doi.org/10.1590/0101-7438.2017.037.03.0487openalex-snapshot
SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
inferred← citeshttps://doi.org/10.18419/opus-2678openalex-snapshot
Shortest paths and negative cycle detection in graphs with negative weights. I, The Bellman-Ford-Moore algorithm revisited
inferred← citeshttps://doi.org/10.21236/ada138935openalex-snapshot
Implementation of an Optimal Multicommodity Network Flow Algorithm Based on Gradient Projection and a Path Flow Formulation
inferred← citeshttps://doi.org/10.21869/2223-1560-2020-24-2-153-169openalex-snapshot
Development of the Authors' Method for Arranging Routes for Elimination of Unauthorized Dumps
inferred← citeshttps://doi.org/10.22028/d291-25720openalex-snapshot
Design and analysis of sequential and parallel single-source shortest-paths algorithms
inferred← citeshttps://doi.org/10.25046/aj050225openalex-snapshot
A Study on the Effects of Combining Different Features for the Recognition of Handwritten Bangla Characters
inferred← citeshttps://doi.org/10.26076/1a2b-70abopenalex-snapshot
Modeling Overlapping and Heterogeneous Perception Variance in Stochastic User Equilibrium Problem with Weibit Route Choice Model
inferred← citeshttps://doi.org/10.28925/2663-4023.2019.3.6387openalex-snapshot
A METHOD OF FORMING OF ANTI-VIRUS PROTECTION OF DATA IS WITH THE USE OF SAFE ROUTING OF METADATAS
inferred← citeshttps://doi.org/10.3141/1645-21openalex-snapshot
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
inferred← citeshttps://doi.org/10.3141/2176-10openalex-snapshot
Accelerated Procedure of Multiclass Highway Traffic Assignment for Maryland Statewide Transportation Model
inferred← citeshttps://doi.org/10.3141/2567-11openalex-snapshot
Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach
inferred← citeshttps://doi.org/10.3390/ijgi8120538openalex-snapshot
The ε-Approximation of the Time-Dependent Shortest Path Problem Solution for All Departure Times
inferred← citeshttps://doi.org/10.4018/jcit.20220701.oa4openalex-snapshot
Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1905.07448openalex-snapshot
Shortest Path Algorithms between Theory and Practice
inferred← citeshttps://doi.org/10.5555/285730.285812openalex-snapshot
A dynamically-directed switch model for MOS logic simulation
inferred← citeshttps://doi.org/10.5555/314464.314638openalex-snapshot
Shortest paths algorithms: theory and experimental evaluation
inferred← citeshttps://doi.org/10.5772/8964openalex-snapshot
A Multi Agent System Modelling an Intelligent Transport System
inferred← citeshttps://doi.org/10.6028/jres.083.038openalex-snapshot
A critical review of comparisons of mathematical programming algorithms and software (1953-1977)
inferred← citeshttps://doi.org/10.6028/jres.086.013openalex-snapshot
Properties of Labeling Methods for Determining Shortest Path Trees
inferred← citeshttps://doi.org/10.70675/70911118z386dz47deza143zf5a0232bdbd6openalex-snapshot
Real time image processing : algorithm parallelization on multicore multithread architecture
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.