Pages that link to "Item:Q1768607"
From MaRDI portal
The following pages link to \(b\)-tree facets for the simple graph partitioning polytope (Q1768607):
Displaying 7 items.
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Binary space partitioning trees as an alternative representation of polytopes (Q805288) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)