期刊名称:International Journal of Computer Science Issues
印刷版ISSN:1694-0784
电子版ISSN:1694-0814
出版年度:2012
卷号:9
期号:3
出版社:IJCSI Press
摘要:In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great role in deducing small linearization. Further tight strategies are also discussed.