Improving SDP bounds for continuous and integer nonconvex quadratic programs(一)
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,