Pages that link to "Item:Q3974969"
From MaRDI portal
The following pages link to Complete descriptions of small multicut polytopes (Q3974969):
Displaying 11 items.
- The inequicut cone (Q688255) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Clique-Web Facets for Multicut Polytopes (Q4027782) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- On the dominant of the multicut polytope (Q6624194) (← links)