QUBO software
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Adaptive memory tabu search for binary quadratic programs
- Algorithm 778: L-BFGS-B
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- Construction of test problems in quadratic bivalent programming
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Pseudo-Boolean optimization
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Unconstrained quadratic bivalent programming problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
Cited in
(4)
This page was built for publication: QUBO software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050151)