Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes

Aardal, 1997, Polyhedral combinatorics Nemhauser, 1988 De Souza, 1995, Some new classes of facets for the equicut polytope, Discrete Appl. Math., 62, 167, 10.1016/0166-218X(94)00151-3 Ferreira, 1996, Formulations and valid inequalities for the node capacitated graph partitioning problem, Math. Program., 74, 247, 10.1007/BF02592198 Garey, 1979 Conforti, 1990, The equipartition polytope II: Valid inequalities and facets, Math. Program., 49, 71, 10.1007/BF01588779 Sørensen, 2004, b-Tree facets for the simple graph partitioning polytope, J. Comb. Optim., 8, 151, 10.1023/B:JOCO.0000031417.96218.26 Sørensen, 2007, Facet-defining inequalities for the simple graph partitioning polytope, Discrete Optim., 4, 221, 10.1016/j.disopt.2006.08.001 Faigle, 1986, A cutting plane algorithm for optimal graph partitioning, Methods Oper. Res., 57, 109 Armbruster, 2008, On the graph bisection cut polytope, SIAM J. Discrete Math., 22, 1073, 10.1137/060675253 Hager, 2013, An exact algorithm for graph partitioning, Math. Program., 137, 531, 10.1007/s10107-011-0503-x Conforti, 1990, The equipartition polytope I: Formulations, dimension and basic facets, Math. Program., 49, 49, 10.1007/BF01588778 Labbé, 2010, Size-constrained graph partitioning polytopes, Discrete Math., 310, 3473, 10.1016/j.disc.2010.08.009 Ferreira, 1998, The node capacitated graph partitioning problem: A computational study, Math. Program., 81, 229, 10.1007/BF01581107