On the public citation graph
Multiobjective A * search with consistent heuristics
0 signed · 119 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/11881216_20openalex-snapshot
Comparison of Heuristics in Multiobjective A* Search
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_6openalex-snapshot
Network Search Algorithms with Modifiable Heuristics
inferredcites →https://doi.org/10.1007/978-3-322-86853-4openalex-snapshot
Multiobjective Heuristic Search
inferredcites →https://doi.org/10.1007/978-3-642-04617-9_4openalex-snapshot
A Memory-Efficient Search Strategy for Multiobjective Shortest Path Problems
inferredcites →https://doi.org/10.1007/978-3-642-48782-8_9openalex-snapshot
Bicriterion Path Problems
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0004-3702(84)90003-1openalex-snapshot
A heuristic search algorithm with modifiable estimate
inferredcites →https://doi.org/10.1016/0020-0190(95)00086-ropenalex-snapshot
Utility of pathmax in partial order heuristic search
inferredcites →https://doi.org/10.1016/j.ejor.2003.12.013openalex-snapshot
A preference-based approach to spanning trees and shortest paths problems****
inferredcites →https://doi.org/10.1016/s0004-3702(02)00371-5openalex-snapshot
Multiobjective heuristic state-space planning
inferredcites →https://doi.org/10.1016/s0377-2217(01)00188-6openalex-snapshot
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
inferredcites →https://doi.org/10.1016/s0377-2217(02)00517-9openalex-snapshot
Multicriteria heuristic search
inferredcites →https://doi.org/10.1023/a:1011242703014openalex-snapshot
State Space Search with Prioritised Soft Constraints
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/322092.322095openalex-snapshot
On the Average Number of Maxima in a Set of Vectors and Applications
inferredcites →https://doi.org/10.1145/358172.358406openalex-snapshot
Optimal paths in graphs with stochastic or multidimensional weights
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.22174openalex-snapshot
Targeted multiobjective Dijkstra algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-60337-3_31openalex-snapshot
Energy-Efficient Path Planning Algorithm on Three-Dimensional Large-Scale Terrain Maps for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-030-66723-8_16openalex-snapshot
Hierarchical Multiobjective Shortest Path Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-72062-9_30openalex-snapshot
Many-Objective Pathfinding Based on Fréchet Similarity Metric
inferred← citeshttps://doi.org/10.1007/978-3-032-30424-7_17openalex-snapshot
An Adapted Multi-objective Pareto A* Framework for an Inclusive Trip Planning for Older Adults
inferred← citeshttps://doi.org/10.1007/978-3-032-36217-9_28openalex-snapshot
NEATWork: A Spatial Network Optimizer
inferred← citeshttps://doi.org/10.1007/978-3-319-13563-2_20openalex-snapshot
A Multi-Objective A* Search Based on Non-dominated Sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-16111-7_27openalex-snapshot
An Empirical Comparison of Some Multiobjective Graph Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-25274-7_25openalex-snapshot
Heuristic Multiobjective Search for Hazmat Transportation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-32964-7_2openalex-snapshot
Exploiting Prior Information in Multi-objective Route Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_16openalex-snapshot
Time-Dependent Route Planning with Generalized Objective Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-35101-3_20openalex-snapshot
Anytime Algorithms for Biobjective Heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-642-40643-0_1openalex-snapshot
An Evaluation of Best Compromise Search in Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_20openalex-snapshot
Proactive Bi-objective Multi-path Planning for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-981-96-3506-1_12openalex-snapshot
VBEA: Voting-Based Evolutionary Algorithm for Multi-objective Planning
inferred← citeshttps://doi.org/10.1007/s00521-025-11437-6openalex-snapshot
An efficient all-pairs approach for multi-objective dynamic shortest path problems
inferred← citeshttps://doi.org/10.1007/s10732-021-09489-7openalex-snapshot
Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints
inferred← citeshttps://doi.org/10.1007/s10845-012-0632-yopenalex-snapshot
A comparison of multiobjective depth-first algorithms
inferred← citeshttps://doi.org/10.1007/s10898-015-0324-1openalex-snapshot
Lower bound sets for biobjective shortest path problems
inferred← citeshttps://doi.org/10.1007/s11047-022-09908-zopenalex-snapshot
A comparison of distance metrics for the multi-objective pathfinding problem
inferred← citeshttps://doi.org/10.1007/s11280-021-00871-wopenalex-snapshot
An efficient index method for the optimal path query over multi-cost networks
inferred← citeshttps://doi.org/10.1007/s11590-019-01453-6openalex-snapshot
Conflict-free routing of multi-stop warehouse trucks
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.1007/s41315-026-00574-3openalex-snapshot
Safe and efficient ground robot navigation via costmap-guided multi-objective A*
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103807openalex-snapshot
Simple and efficient bi-objective search algorithms via fast dominance checks
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.2017.07.010openalex-snapshot
Minimizing the fuel consumption and the risk in maritime transportation: A bi-objective weather routing approach
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100004openalex-snapshot
The Steiner bi-objective shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.08.030openalex-snapshot
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
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.eswa.2011.12.022openalex-snapshot
Multiobjective heuristic search in road maps
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.130654openalex-snapshot
A multi-objective multigraph A* algorithm with online likely-admissible heuristics using walk-based shallow embeddings
inferred← citeshttps://doi.org/10.1016/j.ins.2016.12.041openalex-snapshot
CAPRA: A contour-based accessible path routing algorithm
inferred← citeshttps://doi.org/10.1016/j.trc.2015.07.011openalex-snapshot
A real-time Active Routing approach via a database for airport surface movement
inferred← citeshttps://doi.org/10.1016/j.trc.2020.102734openalex-snapshot
Multi-objective routing and scheduling for airport ground movement
inferred← citeshttps://doi.org/10.1016/j.trc.2026.105699openalex-snapshot
A robust multi-objective optimisation method for airport ground movement
inferred← citeshttps://doi.org/10.1080/0305215x.2024.2446590openalex-snapshot
A novel path-finding approach for maritime search-and-rescue missions incorporating dynamic probability of a target location
inferred← citeshttps://doi.org/10.1080/13658816.2024.2347319openalex-snapshot
A hierarchical model with hexagon grids for multi-objective route planning in large-scale off-road environments
inferred← citeshttps://doi.org/10.1109/aero50100.2021.9438262openalex-snapshot
Many-Objective Maritime Path Planning for Dynamic and Uncertain Environments
inferred← citeshttps://doi.org/10.1109/cec45853.2021.9504943openalex-snapshot
Multi-Objective A* Algorithm for the Multimodal Multi-Objective Path Planning Optimization
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870278openalex-snapshot
The multi-objective dynamic shortest path problem
inferred← citeshttps://doi.org/10.1109/cog47356.2020.9231929openalex-snapshot
The FESS Algorithm: A Feature Based Approach to Single-Agent Search
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/icra48506.2021.9560985openalex-snapshot
Multi-objective Conflict-based Search for Multi-agent Path Finding
inferred← citeshttps://doi.org/10.1109/icuas.2014.6842295openalex-snapshot
Multi-Objective UAV routing
inferred← citeshttps://doi.org/10.1109/ipdps.2013.89openalex-snapshot
Parallel Label-Setting Multi-objective Shortest Path Search
inferred← citeshttps://doi.org/10.1109/is57118.2022.10019653openalex-snapshot
Multi-objective Multigraph A* Search with Learning Heuristics based on Node Metrics and Graph Embedding
inferred← citeshttps://doi.org/10.1109/iscas.2016.7538930openalex-snapshot
Multiobjective path planning on uneven terrains based on NAMOA
inferred← citeshttps://doi.org/10.1109/joe.2025.3604173openalex-snapshot
Intelligent Search and Multiobjective Path Planning With Application to Ship Routing
inferred← citeshttps://doi.org/10.1109/lra.2022.3146918openalex-snapshot
Multi-Objective Path-Based D* Lite
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/mc.2026.3684755openalex-snapshot
From Shortest Path to Safest Path
inferred← citeshttps://doi.org/10.1109/mlsp55844.2023.10286009openalex-snapshot
Belief Propagation of Pareto Front in Multi-Objective MDP Graphs
inferred← citeshttps://doi.org/10.1109/ssci50451.2021.9659956openalex-snapshot
A Customized Niching Methodology for the Many-Objective Pathfinding Problem
inferred← citeshttps://doi.org/10.1109/ssci52147.2023.10371802openalex-snapshot
Airport Ground Movement Optimization Revisited: Coupling Airport Runway Spacing to Multi-Objective Routing and Scheduling Through Genetic Algorithms
inferred← citeshttps://doi.org/10.1109/tase.2022.3183183openalex-snapshot
A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding
inferred← citeshttps://doi.org/10.1109/tevc.2021.3089050openalex-snapshot
A Scalable Many-Objective Pathfinding Benchmark Suite
inferred← citeshttps://doi.org/10.1109/tii.2018.2844370openalex-snapshot
Shortest Path Planning for Energy-Constrained Mobile Platforms Navigating on Uneven Terrains
inferred← citeshttps://doi.org/10.1109/tits.2016.2577047openalex-snapshot
Practical Multicriteria Urban Bicycle Routing
inferred← citeshttps://doi.org/10.1109/tits.2022.3194523openalex-snapshot
Exploring Public Transport Transfer Opportunities for Pareto Search of Multicriteria Journeys
inferred← citeshttps://doi.org/10.1109/tits.2025.3556410openalex-snapshot
Multi-Objective Optimization for Multimodal Multi-Objective Multi-Point Shortest Path Problem Considering Unforeseeable Road Eventualities
inferred← citeshttps://doi.org/10.1109/tro.2025.3600155openalex-snapshot
Online Pareto-Optimal Decision-Making for Complex Tasks Using Active Inference
inferred← citeshttps://doi.org/10.1109/tsmc.2016.2560418openalex-snapshot
An Exact Algorithm for the Shortest Path Problem With Position-Based Learning Effects
inferred← citeshttps://doi.org/10.1111/tgis.70240openalex-snapshot
Multi‐Objective Off‐Road Path Planning on the Basis of the Improved Dominance Check Strategy
inferred← citeshttps://doi.org/10.1145/2633661.2633669openalex-snapshot
Urban wireless community networks
inferred← citeshttps://doi.org/10.1145/3205455.3205558openalex-snapshot
A rolling window with genetic algorithm approach to sorting aircraft for automated taxi routing
inferred← citeshttps://doi.org/10.1145/3300148openalex-snapshot
Quality Evaluation of Solution Sets in Multiobjective Optimisation
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/3787460openalex-snapshot
An Integrated Approach to Multi-agent Scheduling with Bounded Objectives in an Urban Setting
inferred← citeshttps://doi.org/10.1145/3797905.3800547openalex-snapshot
MPMOS: Massively Parallel Multi-Objective Shortest Paths
inferred← citeshttps://doi.org/10.1155/2020/4693750openalex-snapshot
A Computational Framework for Revealing Competitive Travel Times with Low-Carbon Modes Based on Smartphone Data Collection
inferred← citeshttps://doi.org/10.1155/atr/7536217openalex-snapshot
A New Multiobjective A∗ Algorithm With Time Window Applied to Large Airports
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/trsc.2018.0889openalex-snapshot
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
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.15622/rcai.2025.101openalex-snapshot
ДЕЦЕНТРАЛИЗОВАННАЯ МНОГОКРИТЕРИАЛЬНАЯ МАРШРУТИЗАЦИЯ
inferred← citeshttps://doi.org/10.1613/jair.4100openalex-snapshot
A Case of Pathology in Multiobjective Heuristic Search
inferred← citeshttps://doi.org/10.23919/ccc64809.2025.11179664openalex-snapshot
Efficient Bi-Objective UAV Inspection Path Planning with Dynamic Task
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-1149openalex-snapshot
Bicycle Route Planning with Route Choice Preferences
inferred← citeshttps://doi.org/10.3390/a16030162openalex-snapshot
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
inferred← citeshttps://doi.org/10.3390/app8091425openalex-snapshot
Solving the Path Planning Problem in Mobile Robotics with the Multi-Objective Evolutionary Algorithm
inferred← citeshttps://doi.org/10.3390/app8112253openalex-snapshot
Mobile Robot Path Planning with a Non-Dominated Sorting Genetic Algorithm
inferred← citeshttps://doi.org/10.3390/su12155901openalex-snapshot
Analysis of Potential Shift to Low-Carbon Urban Travel Modes: A Computational Framework Based on High-Resolution Smartphone Data
inferred← citeshttps://doi.org/10.3390/systems12060187openalex-snapshot
NEMAS: Norm Entrepreneurship in Multi-Agent Systems
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2014.138openalex-snapshot
Speed-Consumption Tradeoff for Electric Vehicle Route Planning
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2020.10openalex-snapshot
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1907.09041openalex-snapshot
Combining the Connection Scan Algorithm with Contraction Hierarchies
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09812openalex-snapshot
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12424openalex-snapshot
An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10302openalex-snapshot
Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00745openalex-snapshot
Multi-objective Conflict-based Search Using Safe-interval Path Planning
inferred← citeshttps://doi.org/10.5194/isprsarchives-xl-4-w1-1-2013openalex-snapshot
WALKYOURPLACE – EVALUATING NEIGHBOURHOOD ACCESSIBILITY AT STREET LEVEL
inferred← citeshttps://doi.org/10.5445/ir/1000047759openalex-snapshot
Time-Dependent Route Planning with Contraction Hierarchies
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-483openalex-snapshot
An analysis of multiobjective search algorithms and heuristics
inferred← citeshttps://doi.org/10.5604/01.3001.0012.2101openalex-snapshot
Generalized route planning approach for hazardous materials transportation with equity consideration
inferred← citeshttps://doi.org/10.70675/14fdc3cczbed6z41afza63dzfa2a3f1af42copenalex-snapshot
Optimisation des routes maritimes : un système de résolution multicritère et dépendant du temps
inferred← citeshttps://doi.org/10.70675/eff54415z7c4ez475dz9c62z6cbda2665514openalex-snapshot
Calcul de plus courts chemins multicritères et problèmes géométriques connexes
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.