Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
type: Item
instance of: scholarly article
title: Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
zbMATH Open document ID: 1185.90214
author: B. E. Eshmatov
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
full work available at URL: pmc2808708
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5702687
zbMATH Keywords: quadratic unconstrained binary optimization
zbMATH Keywords: multicommodity flow
zbMATH Keywords: network flow
zbMATH Keywords: persistency
zbMATH Keywords: roof duality
Wikidata QID: Q41842403
MaRDI profile type: Publication
OpenAlex ID: W2035297690
cites work: Q3056948
cites work: Upper-bounds for quadratic 0-1 maximization
cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization
DBLP publication ID: journals/dam/WangK09
DOI: 10.1016/J.DAM.2009.07.009
Recommended article: The Quadratic Unconstrained Binary Optimization Problem
Recommended article: The unconstrained binary quadratic programming problem: a survey
Recommended article: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Recommended article: Q4731008
Recommended article: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
Recommended article: Faster approximate multicommodity flow using quadratically coupled flows
Recommended article: Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
Recommended article: Lagrangean decompositions for the unconstrained binary quadratic programming problem
Recommended article: Unconstrained quadratic bivalent programming problem
Recommended article: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
description: scientific article; zbMATH DE number 5702687