Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
1. On the cut polytope
2. J. Cheriyan, W.H. Cunningham, L. Tunçel, Y. Wang, A linear programming and rounding approach to max 2-sat, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence RI, 1996, pp. 395–414.
3. E. Cheng, Wheel inequalities for stable set polytopes, Ph.D. Thesis, University of Waterloo, 1995.
4. W.H. Cunningham, L. Tunçel, Y. Wang, A polyhedral approach to maximum 2-satisfiability, in preparation.
5. The cut polytope and the Boolean quadric polytope
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献