1 citations · 1 across the 3 of their papers we have counts for
3 papers
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
Edoardo Alessandroni, Sergi Ramos-Calderer, Michel Krispin +7
Quadratic unconstrained binary optimization (QUBO) provides problem formulations for various computational problems that can be solved with dedicated QUBO solvers, based on classic…
A comprehensive benchmark of an Ising machine on the Max-Cut problem
Salwa Shaglel, Markus Kirsch, Marten Winkler +4
QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of…
Transformation-Dependent Performance-Enhancement of Digital Annealer for 3-SAT
Christian Münch, Fritz Schinkel, Sebastian Zielinski +1
Quadratic Unconstrained Binary Optimization (QUBO) problems are NP-hard problems and many real-world problems can be formulated as QUBO. Currently there are no algorithms known tha…