The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases

We consider the bipartite unconstrained 0–1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0–1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known to be MAX SNP hard. We show that if the rank of an associat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 193; s. 1 - 10
Hlavní autoři: Punnen, Abraham P., Sripratak, Piyashat, Karapetyan, Daniel
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.10.2015
Témata:
0–1 variables
Complexity
Polynomial algorithms
Pseudo-Boolean programming
Quadratic programming
Polynomial algorithms
0–1 variables
Pseudo-Boolean programming
Quadratic programming
Complexity
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the bipartite unconstrained 0–1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0–1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known to be MAX SNP hard. We show that if the rank of an associated m×n cost matrix Q=(qij) is fixed, then BQP01 can be solved in polynomial time. When Q is of rank one, we provide an O(nlogn) algorithm and this complexity reduces to O(n) with additional assumptions. Further, if qij=ai+bj for some ai and bj, then BQP01 is shown to be solvable in O(mnlogn) time. By restricting m=O(logn), we obtain yet another polynomially solvable case of BQP01 but the problem remains MAX SNP hard if m=O(nk) for a fixed k. Finally, if the minimum number of rows and columns to be deleted from Q to make the remaining matrix non-negative is O(logn), then we show that BQP01 is polynomially solvable but it is NP-hard if this number is O(nk) for any fixed k.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2015.04.004