Research Repository

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

Punnen, Abraham P and Sripratak, Piyashat and Karapetyan, Daniel (2015) 'The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases.' Discrete Applied Mathematics, 193. 1 - 10. ISSN 0166-218X

[img]
Preview
Text
1212.3736v3.pdf - Accepted Version

Download (236kB) | Preview
Item Type: Article
Uncontrolled Keywords: Quadratic programming 0–1 variables Polynomial algorithms Complexity Pseudo-Boolean programming
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 24 May 2018 10:26
Last Modified: 24 May 2018 11:15
URI: http://repository.essex.ac.uk/id/eprint/22056

Actions (login required)

View Item View Item