Pages that link to "Item:Q752015"
From MaRDI portal
The following pages link to Facets of the clique partitioning polytope (Q752015):
Displayed 25 items.
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Facets for the cut cone. I (Q1199749) (← 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)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← 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)
- The partition problem (Q2366610) (← 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)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Models for machine-part grouping in cellular manufacturing (Q4230175) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)