The following pages link to The partition problem (Q2366610):
Displayed 16 items.
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
- Min-cut clustering (Q1321669) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)