Multiobjective A*
From MaRDI portal
Recommendations
Cited in
(35)- Multiobjective, preference-based search in acyclic OR-graphs
- Iterative deepening multiobjective \(A^{*}\)
- Utility of pathmax in partial order heuristic search
- Multicriteria heuristic search.
- A biobjective Dijkstra algorithm
- Intelligent transportation systems -- Enabling technologies
- A DEA model for the efficiency evaluation of nondominated paths on a road network
- A decision-theoretic approach to robust optimization in multivalued graphs
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Searching game trees under a partial order
- Simple and efficient bi-objective search algorithms via fast dominance checks
- Computation of the optimal value function in time-dependent networks
- Search for the best compromise solution on multiobjective shortest path problem
- Multiobjective shortest path problems with lexicographic goal-based preferences
- scientific article; zbMATH DE number 5887313 (Why is no real title available?)
- A multiobjective incremental heuristic search algorithm
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem
- Hierarchical multiobjective shortest path problems
- Dimensionality reduction in multiobjective shortest path search
- Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
- scientific article; zbMATH DE number 4045171 (Why is no real title available?)
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- Multi-objective optimization using metaheuristics: non-standard algorithms
- The constrained reliable shortest path problem in stochastic time-dependent networks
- Partial order bounding: A new approach to evaluation in game tree search
- Heuristic search strategies for multiobjective state space search
- The Steiner bi-objective shortest path problem
- Decision making with multiple objectives using GAI networks
- Maximisation of admissible multi-objective heuristics
- EMOA^*: a framework for search-based multi-objective path planning
- A preference-based approach to spanning trees and shortest paths problems
- Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach
- Multiobjective heuristic state-space planning
- Lower bound sets for biobjective shortest path problems
This page was built for publication: Multiobjective A*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302855)
