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 |
---|---|
格式: | 雜誌 |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84938291413&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44164 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases
由: Abraham P. Punnen, et al.
出版: (2018) -
Worst case analyses of nearest neighbor heuristic for finding the minimum weight k-cycle
由: Tanapat Chalarux, et al.
出版: (2020) -
An attempt to classify bipartite graphs by chromatic polynomials
由: Dong, F.M., et al.
出版: (2014) -
Exactly solvable nonlinear eigenvalue problems
由: Wang, QH
出版: (2022) -
Solvable trees
由: Gervacio, Severino V., et al.
出版: (2008)