Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis

DOI10.1002/NET.21751MaRDI QIDQ6496345zbMATH OpenFDO

Authors Mark W. Lewis, Fred Glover

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.21751

zbMATH Keywords

Ising modelquantum annealingpreprocessingnetwork reductionquadratic unconstrained binary optimizationbinary quadratic optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
• Boosting quantum annealer performance via sample persistence
• The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
• Template-Based Minor Embedding for Adiabatic Quantum Optimization
• Penalty and partitioning techniques to improve performance of QUBO solvers

Cites work

• A unified modeling and solution framework for combinatorial optimization problems
• Adaptive memory tabu search for binary quadratic programs
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
• Building an iterative heuristic solver for a quantum annealer
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Fast clique minor generation in Chimera qubit connectivity graphs
• Generalized networks: the theory of preprocessing and an empirical analysis
• 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
• Path relinking for unconstrained binary quadratic programming
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Robust optimization for unconstrained simulation-based problems
• The unconstrained binary quadratic programming problem: a survey

Cited in

(7)

• On the benefits of a new continuous reformulation for QUBO problems
• A study of scalarisation techniques for multi-objective QUBO solving
• The set partitioning problem in a quantum context
• Fast numerical solver of Ising optimization problems via pruning and domain selection
• Curve fitting on a quantum annealer for an advanced navigation method
• Toward computing bounds for Ramsey numbers using quantum annealing
• A degree reduction method for an efficient QUBO formulation for the graph coloring problem

This page was built for publication: Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496345)