On the public citation graph
Targeted multiobjective Dijkstra algorithm
0 signed · 45 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/net.21815openalex-snapshot
Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
inferredcites →https://doi.org/10.1002/net.22174openalex-snapshot
Targeted multiobjective Dijkstra algorithm
inferredcites →https://doi.org/10.1007/978-3-540-69507-3_6openalex-snapshot
Point-to-Point Shortest Path Algorithms with Preprocessing
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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0377-2217(84)90077-8openalex-snapshot
On a multicriteria shortest path problem
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.cor.2015.05.007openalex-snapshot
Dimensionality reduction in multiobjective shortest path search
inferredcites →https://doi.org/10.1016/j.cor.2021.105424openalex-snapshot
An Improved Multiobjective Shortest Path Algorithm
inferredcites →https://doi.org/10.1016/j.ejor.2014.05.008openalex-snapshot
Multiobjective shortest path problems with lexicographic goal-based preferences
inferredcites →https://doi.org/10.1016/j.ejor.2019.01.007openalex-snapshot
A biobjective Dijkstra algorithm
inferredcites →https://doi.org/10.1016/s0305-0548(99)00037-4openalex-snapshot
A label correcting approach for solving bicriterion shortest-path problems
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1145/1754399.1754400openalex-snapshot
Multiobjective A * search with consistent heuristics
inferredcites →https://doi.org/10.1287/trsc.2020.0981openalex-snapshot
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
inferredcites →https://doi.org/10.3390/a14020043openalex-snapshot
An FPTAS for Dynamic Multiobjective Shortest Path Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s12532-025-00276-0openalex-snapshot
K-shortest simple paths using biobjective path search
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104542openalex-snapshot
Approximate multi-objective search
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106852openalex-snapshot
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2026.128281openalex-snapshot
Ship pipeline route intelligent design via energy-field constraint quantification and improved hybrid evolutionary computation
inferred← citeshttps://doi.org/10.1017/s0263574725102932openalex-snapshot
Application of improved ant colony algorithm fusing Bresenham and direction factor in mobile robot path planning
inferred← citeshttps://doi.org/10.1080/23249935.2024.2449389openalex-snapshot
Vehicle trajectory reconstruction with sparse automatic license plate recognition data for urban road networks
inferred← citeshttps://doi.org/10.1109/cei60616.2023.10527848openalex-snapshot
Research on UAV Multi-Objective Path Planning Problem Based on Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/icftic64248.2024.10913032openalex-snapshot
Emergency Vehicle Route Planning Considering Demand Urgency Research
inferred← citeshttps://doi.org/10.1109/ojits.2026.3726082openalex-snapshot
Lexicographic Minimum-Violation Motion Planning Using Signal Temporal Logic
inferred← citeshttps://doi.org/10.1109/wconf64849.2025.11233567openalex-snapshot
Transfer Optimization in Public Transport Networks
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31455openalex-snapshot
Exact Multi-objective Path Finding with Negative Weights
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31556openalex-snapshot
A-A*pex: Efficient Anytime Approximate Multi-Objective Search
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31564openalex-snapshot
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures
inferred← citeshttps://doi.org/10.2139/ssrn.5701125openalex-snapshot
Generalizing the Successive Shortest Path Algorithm to solve the Multi-objective Assignment Problem
inferred← citeshttps://doi.org/10.2139/ssrn.6535787openalex-snapshot
Ship Pipeline Route Intelligent Design via Energy-Field Constraint Quantification and Improved Hybrid Evolutionary Computation
inferred← citeshttps://doi.org/10.2139/ssrn.7299984openalex-snapshot
From Semantic Intent to Adaptive Geometric Priors: A Large Language Model-Driven Search Framework for Interactive Pipe Routing
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.3390/a17060222openalex-snapshot
Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends
inferred← citeshttps://doi.org/10.3390/biomimetics10010031openalex-snapshot
Multi-Strategy Improved Red-Tailed Hawk Algorithm for Real-Environment Unmanned Aerial Vehicle Path Planning
inferred← citeshttps://doi.org/10.3390/ijgi14020071openalex-snapshot
An Efficient Route Planning Algorithm for Special Vehicles with Large-Scale Road Network Data
inferred← citeshttps://doi.org/10.3390/sym18030481openalex-snapshot
Multi-Strategy Enhanced Child Drawing Development Optimization Algorithm for Global Optimization Problems and Real Problems
inferred← citeshttps://doi.org/10.36227/techrxiv.24212232openalex-snapshot
AI-Native Multi-Constraint Routing System and Method
inferred← citeshttps://doi.org/10.36227/techrxiv.24212232.v2openalex-snapshot
AI-Native Multi-Constraint Routing System and Method
inferred← citeshttps://doi.org/10.36561/ing.28.4openalex-snapshot
Design and Development of IoT-based Harvesting Robo-Vec
inferred← citeshttps://doi.org/10.55730/1300-011x.3289openalex-snapshot
Deep reinforcement learning-driven decision support system design for precision agriculture: optimizing farming and resource use
inferred← citeshttps://doi.org/10.59277/pra-ser.a.26.3.10openalex-snapshot
Three dimensional path planning for low altitude restricted map obstacle avoidance of police unmanned aerial vehicles based on multi-objective function Q-learning
inferred← citeshttps://doi.org/10.9746/sicetr.61.98openalex-snapshot
Route Planning Using Multi-objective Dijkstra Algorithm for Logistics Drones
showing the first 27 of 28 · page through all 28
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.