Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference42 articles.
1. Anjos, M.F.: 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. Anjos, M.F., Wolkowicz, H.: Geometry of semidefinite max-cut relaxations via matrix ranks. J. Comb. Optim. 6 (3), 237?270 (2002)
3. Anjos, M.F., Wolkowicz, H.: Semidefinite programming for discrete optimization and matrix completion problems. Discr. App. Math. 123 (1?2), 513?577 (2002)
4. Anjos, M.F., Wolkowicz, H.: Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discr. App. Math. 119 (1?2), 79?106 (2002)
5. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0?1 programs. Math. Programming 58 (3, Ser. A), 295?324 (1993)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献