A Note on Clique-Web Facets for Multicut Polytopes
Mathematics of Operations Research
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Solution stability in linear programming relaxations: graph partitioning and unsupervised learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Binary positive semidefinite matrices and associated integer polytopes
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
| Hi-index | 0.00 |