On the public citation graph
Parallel Label-Setting Multi-objective Shortest Path Search
0 signed · 53 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.1006/jpdc.1998.1425openalex-snapshot
A Parallel Priority Queue with Constant Time Operations
inferredcites →https://doi.org/10.1007/978-3-540-77978-0openalex-snapshot
Algorithms and Data Structures : The Basic Toolbox
inferredcites →https://doi.org/10.1007/978-3-540-78474-6_8openalex-snapshot
Parallelization of Bulk Operations for STL Dictionaries
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_22openalex-snapshot
Dynamic Planar Range Maxima Queries
inferredcites →https://doi.org/10.1007/978-3-642-48782-8_9openalex-snapshot
Bicriterion Path Problems
inferredcites →https://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
inferredcites →https://doi.org/10.1007/bf02592101openalex-snapshot
Shortest paths algorithms: Theory and experimental evaluation
inferredcites →https://doi.org/10.1007/bfb0055823openalex-snapshot
A parallelization of Dijkstra's shortest path algorithm
inferredcites →https://doi.org/10.1007/s00453-003-1065-yopenalex-snapshot
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)
inferredcites →https://doi.org/10.1007/s10479-006-0072-1openalex-snapshot
On the cardinality of the Pareto set in bicriteria shortest path problems
inferredcites →https://doi.org/10.1016/0377-2217(84)90077-8openalex-snapshot
On a multicriteria shortest path problem
inferredcites →https://doi.org/10.1016/0377-2217(92)90248-8openalex-snapshot
A multicriteria Pareto-optimal path algorithm
inferredcites →https://doi.org/10.1016/j.cor.2008.02.002openalex-snapshot
A comparison of solution strategies for biobjective shortest path problems
inferredcites →https://doi.org/10.1016/j.ejor.2011.08.030openalex-snapshot
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
inferredcites →https://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferredcites →https://doi.org/10.1023/a:1012602011914openalex-snapshot
Label Correcting Methods to Solve Multicriteria Shortest Path Problems
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1994.365680openalex-snapshot
Scheduling multithreaded computations by work stealing
inferredcites →https://doi.org/10.1145/1754399.1754400openalex-snapshot
Multiobjective A * search with consistent heuristics
inferredcites →https://doi.org/10.1145/800105.803395openalex-snapshot
A new representation for linear lists
inferredcites →https://doi.org/10.5555/3221322.3221681openalex-snapshot
Label Correcting Methods to Solve Multicriteria Shortest Path Problems
inferredcites →https://doi.org/10.5860/choice.42-0990openalex-snapshot
Introduction to parallel computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mcda.1541openalex-snapshot
A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_19openalex-snapshot
Exact Methods for Multi-Objective Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-030-05348-2_17openalex-snapshot
Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-97635-3_36openalex-snapshot
SOPMOA*: Unleashing Shared-Open Parallelism for High-Performance Multi-Objective Pathfinding
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_10openalex-snapshot
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_2openalex-snapshot
Route Planning in Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-54157-0_6openalex-snapshot
The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?
inferred← citeshttps://doi.org/10.1007/s12469-019-00204-1openalex-snapshot
A*-guided heuristic for a multi-objective bus passenger Trip Planning Problem
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104260openalex-snapshot
EMOA*: A framework for search-based multi-objective path planning
inferred← citeshttps://doi.org/10.1016/j.cor.2015.05.007openalex-snapshot
Dimensionality reduction in multiobjective shortest path search
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105424openalex-snapshot
An Improved Multiobjective Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.008openalex-snapshot
Multiobjective shortest path problems with lexicographic goal-based preferences
inferred← citeshttps://doi.org/10.1016/j.engappai.2021.104378openalex-snapshot
BiS4EV: A fast routing algorithm considering charging stations and preferences for electric vehicles
inferred← citeshttps://doi.org/10.1109/globecom59602.2025.11431968openalex-snapshot
A Dual-Queue Asynchronous Parallel Algorithm for Multicriteria Optimal Path Computation
inferred← citeshttps://doi.org/10.1109/icra.2017.7989585openalex-snapshot
Real-time stochastic kinodynamic motion planning via multiobjective search on GPUs
inferred← citeshttps://doi.org/10.1109/itsc55140.2022.9922586openalex-snapshot
Heuristics for Fast One-to-Many Multicriteria Shortest Path Search
inferred← citeshttps://doi.org/10.1109/lra.2022.3187270openalex-snapshot
Multi-Objective Safe-Interval Path Planning With Dynamic Obstacles
inferred← citeshttps://doi.org/10.1109/tits.2023.3282069openalex-snapshot
Fast One-to-Many Multicriteria Shortest Path Search
inferred← citeshttps://doi.org/10.1109/tpds.2025.3536357openalex-snapshot
Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks
inferred← citeshttps://doi.org/10.1145/2692916.2555278openalex-snapshot
Data structures for task-based priority scheduling
inferred← citeshttps://doi.org/10.1145/3624062.3625134openalex-snapshot
A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks
inferred← citeshttps://doi.org/10.1145/3721145.3725781openalex-snapshot
OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths
inferred← citeshttps://doi.org/10.1145/3772290.3772301openalex-snapshot
RESCUE: Routing under Evolving Stochastic Congestion and Uncertain Spread in Wildfire Emergencies
inferred← citeshttps://doi.org/10.1145/3797905.3800547openalex-snapshot
MPMOS: Massively Parallel Multi-Objective Shortest Paths
inferred← citeshttps://doi.org/10.1287/trsc.2020.0981openalex-snapshot
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21764openalex-snapshot
Enhanced Multi-Objective A* Using Balanced Binary Search Trees
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31560openalex-snapshot
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations
inferred← citeshttps://doi.org/10.24963/ijcai.2023/757openalex-snapshot
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities
inferred← citeshttps://doi.org/10.3233/faia230452openalex-snapshot
Improving Bi-Objective Shortest Path Search with Early Pruning
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.4230/oasics.atmos.2014.138openalex-snapshot
Speed-Consumption Tradeoff for Electric Vehicle Route Planning
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.