Autarkies and Persistencies for QUBO

DOI10.1007/978-3-031-04520-2_5zbMath1506.90190OpenAlexW4285031329MaRDI QIDQ5050145

Endre Boros

Publication date: 15 November 2022

Published in: The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-04520-2_5

zbMATH Keywords

persistencyautarky

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Crown structures for vertex cover kernelization
• Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Vertex packings: Structural properties and algorithms
• Faster Parameterized Algorithms Using Linear Programming
• A Selection Problem of Shared Fixed Costs and Network Flows
• Depth-First Search and Linear Graph Algorithms