References
- Alpert , CJ and Kahng , AB . 1995 . Recent directions in netlist partition: A survey . Integr., VLSI J. , 19 : 1 – 81 .
- Arora , S , Karger , M and Karpinski , M . 1999 . Polynomial time approximation schemes for dense instances of NP-hard problems . J. Comput. System Sci. , 58 : 193 – 210 .
- Bomze , M , Duer , M , de Klerk , E , Roos , C , Quist , AJ and Terlaky , T . 2000 . On copositive programming and standard quadratic optimization problems . J. Global Optim. , 18 : 301 – 320 .
- I. Bomze, F. Jarre, and F. Rendl. Quadratic factorization heuristics for copositive programming, Math. Programm. Comput. 3, (2009), 37–57
- Bundfuss , S and Dür , M . 2009 . An adaptive linear approximation algorithm for copositive programs . SIAM J. Optim. , 20 : 30 – 53 .
- Burer , S . 2009 . On the copositive representation of binary and continuous nonconvex quadratic programs . Math. Program. , 120 (Ser. A) : 479 – 495 .
- de Klerk , E and Pasechnik , DV . 2002 . Approximation of the stability number of a graph via copositive programming . SIAM J. Optim. , 12 : 875 – 892 .
- Donath , WE and Hoffman , AJ . 1973 . Lower bounds for the partitioning of graphs . IBM J. Res. Develop. , 17 : 420 – 425 .
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979
- Guttmann-Beck , N and Hassin , R . 2000 . Approximation algorithms for minimum K-cut . Algorithmica , 27 : 198 – 207 .
- Horn , RA and Johnson , CR . 1990 . Matrix Analysis , Cambridge : Cambridge University Press . (Corrected reprint of the 1985 original)
- S.E. Karisch and F. Rendl, Semidefinite programming and graph equipartition, in Topics in Semidefinite and Interior-Point methods (Toronto, ON, 1996), Vol. 18, Fields Institude Communication, American Mathematical Society, Providence, RI, 1998, pp. 77–95
- Lisser , A and Rendl , F . 2003 . Graph partitioning using linear and semidefinite programming . Math. Program. , 95 (Ser. B) : 91 – 101 . ISMP 2000, Part 3 (Atlanta, GA)
- Murty , KG and Kabadi , SN . 1987 . Some NP-complete problems in quadratic and nonlinear programming . Math. Programm. , 39 : 117 – 129 .
- Povh , J . 2009 . Towards the Optimum by Semidefinite and Copositive Programming , Saarbrücken : VDM Verlag Dr. Müller .
- Povh , J . 2010 . Semidefinite approximations for quadratic programs over orthogonal matrices . J. Global Optim. , 48 : 447 – 463 .
- Povh , J and Rendl , F . 2007 . A copositive programming approach to graph partitioning . SIAM J. Optim. , 18 : 223 – 241 .
- Povh , J and Rendl , F . 2009 . Copositive and semidefinite relaxations of the quadratic assignment problem . Discrete Optim. , 6 : 231 – 241 .
- Wolkowicz , H and Zhao , Q . 1999 . Semidefinite programming relaxations for the graph partitioning problem . Discrete Appl. Math. , 96–97 : 461 – 479 .
- Zhao , Q , Karisch , SE , Rendl , F and Wolkowicz , Y . 1998 . Semidefinite programming relaxations for the quadratic assignment problem . J. Combin. Optim. , 2 : 71 – 109 .