Pages that link to "Item:Q3972001"
From MaRDI portal
The following pages link to Composition of facets of the clique partitioning polytope (Q3972001):
Displaying 17 items.
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Facets of the clique partitioning polytope (Q752015) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
- Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← 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)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Adjacency of vertices on the clique partitioning polytope (Q3991025) (← links)
- The polytope of block diagonal matrices and complete bipartite partitionings (Q4369763) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)