The set partitioning problem in a quantum context

DOI10.1007/S11590-023-02029-1MaRDI QIDQ6181360zbMATH OpenFDO

Authors Rafael Cacao, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, I. R. jun. de Farias, Illya V. Hicks

Publication date 22 January 2024

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-023-02029-1

zbMATH Keywords

penalty coefficientsquadratic unconstrained binary optimizationthe set partitioning problemvariational quantum eigensolver

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• Penalty and partitioning techniques to improve performance of QUBO solvers
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Faster exact solution of sparse maxcut and QUBO problems
• A new modeling and solution approach for the set-partitioning problem
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis

Cites work

• A new approach for modeling and solving set packing problems
• A new modeling and solution approach for the set-partitioning problem
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
• The Set-Partitioning Problem: Set Covering with Equality Constraints

Cited in

(1)

• Hybrid quantum annealing for price optimization under cross-elastic demand

This page was built for publication: The set partitioning problem in a quantum context

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