Approximate multi-objective search

DOI10.1016/J.ARTINT.2026.104542MaRDI QIDQ7303999zbMATH OpenFDO

Authors Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig

Publication date 24 July 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2026.104542

Mathematics Subject Classification ID

Approximation algorithms (68W25) Multi-objective and goal programming (90C29)

Cites work

• A biobjective Dijkstra algorithm
• A dual algorithm for the constrained shortest path problem
• A simple efficient approximation scheme for the restricted shortest path problem
• A tutorial on multiobjective optimization: fundamentals and evolutionary methods
• An exact bidirectional A^ approach for solving resource-constrained shortest path problems
• An exact bidirectional pulse algorithm for the constrained shortest path
• An improved FPTAS for Restricted Shortest Path.
• Analysis of FPTASes for the multi-objective shortest path problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Dimensionality reduction in multiobjective shortest path search
• EMOA^*: a framework for search-based multi-objective path planning
• Hierarchical multiobjective shortest path problems
• scientific article; zbMATH DE number 7740858 (Why is no real title available?)
• Multi-Objective Decision Making
• Multicriteria Optimization
• Multiobjective optimization. Interactive and evolutionary approaches
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Simple and efficient bi-objective search algorithms via fast dominance checks
• Survey of multi-objective optimization methods for engineering
• Targeted multiobjective Dijkstra algorithm
• The maximin HAZMAT routing problem

This page was built for publication: Approximate multi-objective search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303999)