The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
Hi-index | 0.04 |