A preprocessing technique for quadratic unconstrained binary optimization

DOI10.1016/J.DISOPT.2025.100914MaRDI QIDQ7310963zbMATH OpenFDO

Authors Serigne Gueye, Philippe Michelon

Publication date 6 August 2026

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2025.100914

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20) Combinatorial optimization (90C27) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• Adaptive memory tabu search for binary quadratic programs
• Autarkies and Persistencies for QUBO
• Engineering Kernelization for Maximum Cut
• Faster exact solution of sparse maxcut and QUBO problems
• scientific article; zbMATH DE number 3717129 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3404028 (Why is no real title available?)
• Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
• Methods of Nonlinear 0-1 Programming
• Resolution search

This page was built for publication: A preprocessing technique for quadratic unconstrained binary optimization

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