Applications and computational advances for solving the QUBO model
From MaRDI portal
Recommendations
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Mathematical programming models and exact algorithms
- Complexity and polynomially solvable special cases of QUBO
Cites work
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A new approach for modeling and solving set packing problems
- A new modeling and solution approach for the set-partitioning problem
- A note on xQx as a modelling and solution framework for the linear ordering problem
- A unified modeling and solution framework for combinatorial optimization problems
- An effective modeling and solution approach for the generalized independent set problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Clustering of microarray data via clique partitioning
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- Credit Risk Analysis Using Quantum Computers
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Pseudo-Boolean optimization
- Quadratic binary programming models in computational biology
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic reformulations of nonlinear binary optimization problems
- Quantum annealing for combinatorial clustering
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Resolution for Max-SAT
- Solving group technology problems via clique partitioning
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Support vector machines on the D-wave quantum annealer
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- The unconstrained binary quadratic programming problem: a survey
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Cited in
(13)- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- Penalty and partitioning techniques to improve performance of QUBO solvers
- QUBO formulation for the contact map overlap problem
- Complexity and polynomially solvable special cases of QUBO
- Mathematical programming models and exact algorithms
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- New advances for quantum-inspired optimization
- Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
- A large population island framework for the unconstrained binary quadratic problem
This page was built for publication: Applications and computational advances for solving the QUBO model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050142)
