@inproceedings{732c99e475b74b8b822bcca6e7f23c5e,
title = "A simple and fast bi-objective search algorithm (extended abstract).",
abstract = "Many interesting search problems can be formulated as biobjective search problems, that is, search problems where two kinds of costs have to be minimized. We describe our new Bi-Objective A∗ (BOA∗) algorithm and show that it can run an order of magnitude (or more) faster than state-of-theart bi-objective search algorithms. See our longer ICAPS paper (Hern{\'a}ndez et al. 2020) for details.",
author = "Ulloa, \{Carlos Hern{\'a}ndez\} and William Yeoh and Baier, \{Jorge A.\} and Han Zhang and Luis Suazo and Sven Koenig",
note = "Publisher Copyright: {\textcopyright} 2020 Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020. All rights reserved.; 13th International Symposium on Combinatorial Search, SoCS 2020 ; Conference date: 26-05-2020 Through 28-05-2020",
year = "2020",
language = "English",
series = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",
publisher = "The AAAI Press",
pages = "125--126",
editor = "Daniel Harabor and Mauro Vallati",
booktitle = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",
}