Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
From MaRDI portal
Publication:967446
DOI10.1016/j.dam.2009.07.009zbMath1185.90214WikidataQ41842403 ScholiaQ41842403MaRDI QIDQ967446
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
persistency; network flow; multicommodity flow; roof duality; quadratic unconstrained binary optimization
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Mathematical Programming Models and Exact Algorithms, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
Cites Work