Continuous and integer 0-1 quadratic programming problems are well-known NP-hard problems in global and discrete optimization. These two classes of problems have many applications in computer science, management and engineering design such as maximum cut,

• 1

  Improving SDP bounds for continuous and integer nonconvex quadratic programs（一）

• 2

  Improving SDP bounds for continuous and integer nonconvex quadratic programs（二）

• 评论统计：

• 力荐-0 %

  

• 推荐-0 %

  

• 还行-0 %

  

• 较差-0 %

  

• 很差-0 %