Applications and Computational Advances for Solving the QUBO Model
From MaRDI portal
Publication:5050142
DOI10.1007/978-3-031-04520-2_2zbMath1506.90194OpenAlexW4285049528MaRDI QIDQ5050142
Gary A. Kochenberger, Fred Glover, Yu Du
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_2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unconstrained binary quadratic programming problem: a survey
- Quadratic reformulations of nonlinear binary optimization problems
- Pseudo-Boolean optimization
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- Solving group technology problems via clique partitioning
- Resolution for Max-SAT
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- Quantum annealing for combinatorial clustering
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- A unified modeling and solution framework for combinatorial optimization problems
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- A new modeling and solution approach for the set-partitioning problem
- An effective modeling and solution approach for the generalized independent set problem
- A new approach for modeling and solving set packing problems
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Clustering of microarray data via clique partitioning
- Support vector machines on the D-wave quantum annealer
- Credit Risk Analysis Using Quantum Computers
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
