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
Discrete Applied Mathematics
Binary positive semidefinite matrices and associated integer polytopes
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Small bipartite subgraph polytopes
Operations Research Letters
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
An SDP approach to multi-level crossing minimization
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |