QUBO Software
From MaRDI portal
Publication:5050151
DOI10.1007/978-3-031-04520-2_11OpenAlexW4285036071MaRDI QIDQ5050151
Gary A. Kochenberger, Abraham P. Punnen, Brad D. Woods
Publication date: 15 November 2022
Published in: The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-04520-2_11
Quadratic programming (90C20) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Uses Software
Cites Work
- Unnamed Item
- Pseudo-Boolean optimization
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Unconstrained quadratic bivalent programming problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- Algorithm 778: L-BFGS-B
- Construction of test problems in quadratic bivalent programming
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
