Automatic Design of Heuristic Algorithms for Binary Optimization Problems
Abstract
In this work we present AutoBQP, a heuristic solver for binary optimization problems. It applies automatic algorithm design techniques to search for the best heuristics for a given optimization problem. Experiments show that the solver can find algorithms which perform better than or comparable to state-of-the-art methods, and can even find new best solutions for some instances of standard benchmark sets.
Cite
Text
de Souza. "Automatic Design of Heuristic Algorithms for Binary Optimization Problems." International Joint Conference on Artificial Intelligence, 2021. doi:10.24963/IJCAI.2021/672Markdown
[de Souza. "Automatic Design of Heuristic Algorithms for Binary Optimization Problems." International Joint Conference on Artificial Intelligence, 2021.](https://mlanthology.org/ijcai/2021/desouza2021ijcai-automatic/) doi:10.24963/IJCAI.2021/672BibTeX
@inproceedings{desouza2021ijcai-automatic,
title = {{Automatic Design of Heuristic Algorithms for Binary Optimization Problems}},
author = {de Souza, Marcelo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2021},
pages = {4881-4882},
doi = {10.24963/IJCAI.2021/672},
url = {https://mlanthology.org/ijcai/2021/desouza2021ijcai-automatic/}
}