Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
From MaRDI portal
Publication:6496345
DOI10.1002/NET.21751MaRDI QIDQ6496345
Publication date: 3 May 2024
Published in: Networks (Search for Journal in Brave)
network reductionIsing modelquantum annealingpreprocessingquadratic unconstrained binary optimizationbinary quadratic optimization
Cites Work
- Fast clique minor generation in Chimera qubit connectivity graphs
- The unconstrained binary quadratic programming problem: a survey
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- A unified modeling and solution framework for combinatorial optimization problems
- Path relinking for unconstrained binary quadratic programming
- Building an iterative heuristic solver for a quantum annealer
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Generalized Networks: The Theory of Preprocessing and an Empirical Analysis
- Robust Optimization for Unconstrained Simulation-Based Problems
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
This page was built for publication: Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
