On the public citation graph
Near-shortest and K-shortest simple paths
0 signed · 79 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.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1openalex-snapshot
An efficient implementation of an algorithm for finding K shortest simple paths
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01585517openalex-snapshot
Implementation and efficiency of Moore-algorithms for the shortest route problem
inferredcites →https://doi.org/10.1007/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferredcites →https://doi.org/10.1089/cmb.1994.1.349openalex-snapshot
On Near-Optimal Alignments of Biological Sequences
inferredcites →https://doi.org/10.1109/90.477723openalex-snapshot
The hop-limit approach for spare-capacity assignment in survivable networks
inferredcites →https://doi.org/10.1109/90.700896openalex-snapshot
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/354644.354662openalex-snapshot
The use of hop-limits to provide survivable ATM group communications
inferredcites →https://doi.org/10.1145/774763.774769openalex-snapshot
Toward an optimization-driven framework for designing and generating realistic Internet topologies
inferredcites →https://doi.org/10.1287/opre.32.6.1381openalex-snapshot
Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.20411openalex-snapshot
Path optimization for the resource‐constrained searcher
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.21552openalex-snapshot
Finding k shortest simple paths in directed graphs: A node classification algorithm
inferred← citeshttps://doi.org/10.1002/net.21815openalex-snapshot
Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_8openalex-snapshot
Ship Scheduling with Recurring Visits and Visit Separation Requirements
inferred← citeshttps://doi.org/10.1007/978-1-4614-8745-6_7openalex-snapshot
A Parallel Algorithm to Solve Near-Shortest Path Problems on Raster Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_12openalex-snapshot
Linear Path Skyline Computation in Bicriteria Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_24openalex-snapshot
Resource Constrained Shortest Paths with a Super Additive Objective Function
inferred← citeshttps://doi.org/10.1007/978-3-658-27041-4_2openalex-snapshot
On Variants of the Single-criterion and Multiobjective Near-Shortest Paths Problem
inferred← citeshttps://doi.org/10.1007/s00453-020-00792-6openalex-snapshot
Approximating the Canadian Traveller Problem with Online Randomization
inferred← citeshttps://doi.org/10.1007/s10109-014-0197-8openalex-snapshot
Corridor location: the multi-gateway shortest path model
inferred← citeshttps://doi.org/10.1007/s10707-016-0274-xopenalex-snapshot
Constrained energy-efficient routing in time-aware road networks
inferred← citeshttps://doi.org/10.1016/j.amc.2012.04.002openalex-snapshot
An efficient time and space K point-to-point shortest simple paths algorithm
inferred← citeshttps://doi.org/10.1016/j.apm.2013.10.059openalex-snapshot
Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.09.016openalex-snapshot
On functional equations for th best policies in Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.cor.2008.02.002openalex-snapshot
A comparison of solution strategies for biobjective shortest path problems
inferred← citeshttps://doi.org/10.1016/j.cor.2011.10.003openalex-snapshot
Robust scheduling on a single machine to minimize total flow time
inferred← citeshttps://doi.org/10.1016/j.cor.2012.03.013openalex-snapshot
A simulated annealing for multi-criteria network path problems
inferred← citeshttps://doi.org/10.1016/j.cor.2014.11.010openalex-snapshot
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.11.003openalex-snapshot
An exact method for the biobjective shortest path problem for large-scale road networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.05.021openalex-snapshot
A branch and price approach for routing and refueling station location model
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.08.020openalex-snapshot
Evasive flow capture: A multi-period stochastic facility location problem with independent demand
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.108987openalex-snapshot
Optimization problems with evidential linear objective
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.111661openalex-snapshot
A two-stage method for doubly resource constrained elementary shortest path problems
inferred← citeshttps://doi.org/10.1016/j.omega.2012.02.002openalex-snapshot
Technology adoption and training practices as a constrained shortest path problem
inferred← citeshttps://doi.org/10.1016/j.trb.2016.09.009openalex-snapshot
Parametric search for the bi-attribute concave shortest path problem
inferred← citeshttps://doi.org/10.1016/j.trc.2016.04.007openalex-snapshot
Prediction of vehicle CO2 emission and its application to eco-routing navigation
inferred← citeshttps://doi.org/10.1029/2011wr010998openalex-snapshot
Deriving multiple near‐optimal solutions to deterministic reservoir operation problems
inferred← citeshttps://doi.org/10.1080/19427867.2022.2042655openalex-snapshot
Modeling and Evaluating the Impact of Electricity Price on Commute Network Flows of Battery Electric Vehicles
inferred← citeshttps://doi.org/10.1109/cscwd.2018.8465299openalex-snapshot
A Fast Algorithm for Finding the Bi-objective Shortest Path in Complicated Networks
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00029openalex-snapshot
Constrained Path Search with Submodular Function Maximization
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00349openalex-snapshot
Congestion-Mitigating Spatiotemporal Routing in Road Networks
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00062openalex-snapshot
Efficient Route and Area Matching Query in Dynamic Road Networks
inferred← citeshttps://doi.org/10.1109/icicta.2009.623openalex-snapshot
Multimodal Traffic Information Service System with K-Multimodal Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1109/itime.2011.6132130openalex-snapshot
A more efficient link-state routing algorithm for telecommunication networks
inferred← citeshttps://doi.org/10.1109/picmet.2009.5261987openalex-snapshot
Technology and business practice adoption as a constrained shortest path problem
inferred← citeshttps://doi.org/10.1111/gean.12159openalex-snapshot
Modeling Bikeability of Urban Systems
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00815.xopenalex-snapshot
Multicriteria path and tree problems: discussion on exact algorithms and applications
inferred← citeshttps://doi.org/10.1142/s0217595916500421openalex-snapshot
Ranking One Million Simple Paths in Road Networks
inferred← citeshttps://doi.org/10.1145/3139958.3140029openalex-snapshot
Finding The Most Preferred Path
inferred← citeshttps://doi.org/10.1145/3690624.3709310openalex-snapshot
Weight-Constrained Simple Path Enumeration in Weighted Graph
inferred← citeshttps://doi.org/10.1155/2017/4586471openalex-snapshot
The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method
inferred← citeshttps://doi.org/10.1177/0160017613507772openalex-snapshot
Corridor Location for Infrastructure Development
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0191openalex-snapshot
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1081openalex-snapshot
An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
inferred← citeshttps://doi.org/10.1287/opre.2018.1756openalex-snapshot
Exact Solution of the Evasive Flow Capturing Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0027506openalex-snapshot
Mining Relational Paths in Integrated Biomedical Data
inferred← citeshttps://doi.org/10.14257/ijhit.2015.8.9.34openalex-snapshot
Construction and Application Of Effective Path Statistics Network
inferred← citeshttps://doi.org/10.21595/jve.2013.10076openalex-snapshot
A new algorithm for finding the k shortest transport paths in dynamic stochastic networks
inferred← citeshttps://doi.org/10.32469/10355/90158openalex-snapshot
Multi-objective network optimization: models, methods, and applications
inferred← citeshttps://doi.org/10.32657/10356/66553openalex-snapshot
Spaital query processing for location based services
inferred← citeshttps://doi.org/10.3390/a17060222openalex-snapshot
Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends
inferred← citeshttps://doi.org/10.3390/app10186190openalex-snapshot
GIS Spatial Optimization for Corridor Alignment Using Simulated Annealing
inferred← citeshttps://doi.org/10.48550/arxiv.1111.7170openalex-snapshot
REX: Explaining Relationships between Entity Pairs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4396openalex-snapshot
Routing Directions: Keeping it Fast and Simple
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06934openalex-snapshot
The K Shortest Paths Problem with Application to Routing
inferred← citeshttps://doi.org/10.48550/arxiv.1906.05101openalex-snapshot
On the Universal Near Shortest Simple Paths Problem
inferred← citeshttps://doi.org/10.53846/goediss-6852openalex-snapshot
Solution Methods for Multi-Objective Robust Combinatorial Optimization
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.