Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. M.F. Anjos. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. PhD thesis, University of Waterloo, 2001. Published online at http://etd.uwaterloo.ca/etd/manjos2001.pdf.
2. M.F. Anjos. An improved semidefinite programming relaxation for the satisfiability problem. Math. Program. (Ser. A), to appear, 2004.
3. M.F. Anjos and H. Wolkowicz. Semidefinite programming for discrete optimization and matrix completion problems. Discrete Appl. Math., 123(1–2):513–577, 2002.
4. M.F. Anjos and H. Wolkowicz. Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Appl. Math., 119(1–2):79–106, 2002.
5. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Program., 58(3, Ser. A):295–324, 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献