Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
From MaRDI portal
Publication:5918755
DOI10.1007/s10479-022-04634-2zbMath1496.90051OpenAlexW4226006885MaRDI QIDQ5918755
Yu Du, Fred Glover, Rick Hennig, Gary A. Kochenberger
Publication date: 1 August 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04634-2
Related Items
Quantum annealing to solve the unrelated parallel machine scheduling problem, High-speed train timetable optimization based on space-time network model and quantum simulator, The set partitioning problem in a quantum context
Uses Software
Cites Work
- The unconstrained binary quadratic programming problem: a survey
- Quadratic reformulations of nonlinear binary optimization problems
- Efficiently embedding QUBO problems on adiabatic quantum computers
- 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
- Solving group technology problems via clique partitioning
- How probability arises in quantum mechanics
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The maximum clique problem
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Path relinking for unconstrained binary quadratic programming
- Quantum adiabatic machine learning
- A new modeling and solution approach for the set-partitioning problem
- A new approach for modeling and solving set packing problems
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Clustering of microarray data via clique partitioning
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- QUBO formulation for the contact map overlap problem
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Quantum adiabatic Markovian master equations
- Aggregating inconsistent information
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
