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...
Saved in:
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 |
Similar Items
-
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases
by: Abraham P. Punnen, et al.
Published: (2018) -
Worst case analyses of nearest neighbor heuristic for finding the minimum weight k-cycle
by: Tanapat Chalarux, et al.
Published: (2020) -
An attempt to classify bipartite graphs by chromatic polynomials
by: Dong, F.M., et al.
Published: (2014) -
Exactly solvable nonlinear eigenvalue problems
by: Wang, QH
Published: (2022) -
Robust optimization for unconstrained simulation-based problems
by: Bertsimas, D., et al.
Published: (2014)