Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

DOI10.1016/j.dam.2009.07.009zbMath1185.90214OpenAlexW2035297690WikidataQ41842403 ScholiaQ41842403MaRDI QIDQ967446

B. E. Eshmatov

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc2808708

zbMATH Keywords

persistencynetwork flowmulticommodity flowroof dualityquadratic unconstrained binary optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Mathematical Programming Models and Exact Algorithms ⋮ Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

Cites Work

• Unnamed Item
• Upper-bounds for quadratic 0-1 maximization
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization

This page was built for publication: Analyzing quadratic unconstrained binary optimization problems via multicommodity flows