Many interesting search problems can be formulated as bi-objective search problems, that
is, search problems where two kinds of costs have to be minimized, for example, travel …

Many interesting search problems can be formulated as bi-objective search problems, that
is, search problems where two kinds of costs have to be minimized, for example, travel …

The Pareto-optimal frontier for a bi-objective search problem instance consists of all
solutions that are not worse than any other solution in both objectives. The size of the Pareto …

Multi-objective search can be used to model many real-world problems that require finding
Paretooptimal paths from a specified start state to a specified goal state, while considering …

Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional
domain. This study proposes several enhancements to the state-of-the-art bi-objective …

We consider the bi-criteria shortest-path problem where we want to compute shortest paths
on a graph that simultaneously balance two cost functions. While this problem has …

In multi-objective search, edges are annotated with cost vectors consisting of multiple cost
components. A path dominates another path with the same start and goal vertices iff the …

In the past few years, new very successful bidirectional heuristic search algorithms have
been proposed. Their key novelty is a lower bound on the cost of a solution that includes …

Abstract Bi-Objective Combinatorial Optimization problems are ubiquitous in real-world
applications and designing approaches to solve them efficiently is an important research …

Bidirectional search algorithms interleave two separate searches, a normal search forward
from the start state, and a search backward from the goal. It is well known that adding a …