Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr, “Higher-order segmentation via multicuts”, Computer Vision and Image Understanding, 143, 2016, 104
Rudolf Müller, “On the partial order polytope of a digraph”, Mathematical Programming, 73, № 1, 1996, 31
Alberto Caprara, Matteo Fischetti, “{0, 1/2}-Chvátal-Gomory cuts”, Mathematical Programming, 74, № 3, 1996, 221
Jamie Fairbrother, Adam N. Letchford, “Projection results for the k-partition problem”, Discrete Optimization, 26, 2017, 97
Guanglei Wang, Hassan Hijazi, “Exploiting sparsity for the min k-partition problem”, Math. Prog. Comp., 12, № 1, 2020, 109
Michael M. Sørensen, “A Note on Clique-Web Facets for Multicut Polytopes”, Mathematics of OR, 27, № 4, 2002, 740
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange, “A polyhedral study of lifted multicuts”, Discrete Optimization, 47, 2023, 100757
Paradigms of Combinatorial Optimization, 2014, 707
Peng Wang, Chunhua Shen, Anton van den Hengel, Philip H. S. Torr, “Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference”, Int J Comput Vis, 117, № 3, 2016, 269
Michael M. Sørensen, “Facet-defining inequalities for the simple graph partitioning polytope”, Discrete Optimization, 4, № 2, 2007, 221