Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
From MaRDI portal
Publication:1681134
DOI10.1016/j.ejor.2017.08.025zbMath1374.90294arXiv1705.09545MaRDI QIDQ1681134
Mark Lewis, Fred Glover, Gary A. Kochenberger
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09545
combinatorial optimization; quantum annealing; preprocessing; graph reduction; quadratic unconstrained binary optimization
Related Items
Mathematical Programming Models and Exact Algorithms, The Bipartite QUBO, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
Uses Software
Cites Work
- Fast clique minor generation in Chimera qubit connectivity graphs
- The unconstrained binary quadratic programming problem: a survey
- A column generation approach for the unconstrained binary quadratic programming problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
- 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
- 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
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
