The following pages link to (Q3753826):
Displayed 8 items.
- Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)