Consolidating Maintenance Spares
Computational Optimization and Applications
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
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
IPCO '07 Proceedings of the 12th international 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
Globally optimal image partitioning by multicuts
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Computer Networks: The International Journal of Computer and Telecommunications Networking
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization
Lifting theorems and facet characterization for a class of clique partitioning inequalities
Operations Research Letters
Cliques and clustering: A combinatorial approach
Operations Research Letters
Globally optimal closed-surface segmentation for connectomics
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Joint kernel learning for supervised image segmentation
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
New bounds and constraint propagation techniques for the clique partitioning problem
Discrete Applied Mathematics
| Hi-index | 0.00 |