Abstract
We discuss a small study on how to compare the performance of various solving techniques for quadratic unconstrained binary optimization (QUBO). Since well-known metrics are seldomly applicable, we suggest comparing the relative performance, i.e., how much the quality of solution (compared to other solutions of the same solver) for a QUBO shifts between different solving techniques. We propose looking for big shifts systematically for an empirical complexity analysis.
Dokumententyp: | Konferenzbeitrag (Paper) |
---|---|
Fakultät: | Mathematik, Informatik und Statistik > Informatik |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik |
ISBN: | 979-8-4007-0120-7 |
Ort: | New York, NY, United States |
Sprache: | Englisch |
Dokumenten ID: | 121844 |
Datum der Veröffentlichung auf Open Access LMU: | 29. Okt. 2024 15:05 |
Letzte Änderungen: | 29. Okt. 2024 15:05 |