Pages that link to "Item:Q1306454"
From MaRDI portal
The following pages link to Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454):
Displayed 9 items.
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)