Penalty and partitioning techniques to improve performance of QUBO solvers

DOI10.1016/j.disopt.2020.100594OpenAlexW3039523682MaRDI QIDQ2673235

Yanyan Li

Publication date: 9 June 2022

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2020.100594

zbMATH Keywords

nonlinear optimizationinequality constraintequality constraintpseudo-Boolean optimizationquadratic unconstrained binary optimization

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Quantum computation (81P68)

Related Items

Penalty weights in QUBO formulations: permutation problems ⋮ Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem

Uses Software

• OR-Library
• GitHub

Cites Work

• Unnamed Item
• The unconstrained binary quadratic programming problem: a survey
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Autocorrelation coefficient for the graph bipartitioning problem
• Embedding equality constraints of optimization problems into a quantum annealer
• Path relinking for unconstrained binary quadratic programming
• Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
• The Monte Carlo Method
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models