\(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
From MaRDI portal
Publication:2163799
DOI10.1007/978-3-031-04148-8_12zbMath1499.90135OpenAlexW4226242749MaRDI QIDQ2163799
Sébastien Verel, Mahmoud Omidvar, Sara Tari
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-04148-8_12
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- A hybrid metaheuristic approach to solving the UBQP problem
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Mixed effects models and extensions in ecology with R
- QAPLIB - a quadratic assignment problem library
- Polynomial unconstrained binary optimisation -- part 1
- Benchmarks for basic scheduling problems
- COCO: a platform for comparing continuous optimizers in a black-box setting
- Optimization via enumeration: A new algorithm for the max cut problem
This page was built for publication: \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance