Simple and efficient bi-objective search algorithms via fast dominance checks
From MaRDI portal
Publication:2680770
DOI10.1016/j.artint.2022.103807OpenAlexW4304944116MaRDI QIDQ2680770
Publication date: 4 January 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103807
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximin HAZMAT routing problem
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- Dimensionality reduction in multiobjective shortest path search
- On a multicriteria shortest path problem
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Multiobjective optimization. Interactive and evolutionary approaches
- A comparison of solution strategies for biobjective shortest path problems
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Analysis of FPTASes for the multi-objective shortest path problem
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- A biobjective Dijkstra algorithm
- Speeding up Martins' algorithm for multiple objective shortest path problems
- An exact method for the biobjective shortest path problem for large-scale road networks
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximating the Pareto Front of Multi-criteria Optimization Problems
- Multiobjective A * search with consistent heuristics
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Multiobjective A*
- Multicriteria Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
This page was built for publication: Simple and efficient bi-objective search algorithms via fast dominance checks
