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

© 2015 Elsevier B.V. All rights reserved. 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 har...

Full description

Saved in:
Bibliographic Details
Main Authors: Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
Format: Journal
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84938291413&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/44164
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University