Pages that link to "Item:Q4027782"

The following pages link to Clique-Web Facets for Multicut Polytopes (Q4027782):

Displaying 34 items.

• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Size-constrained graph partitioning polytopes (Q607006) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• The even and odd cut polytopes (Q688256) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Compositions in the bipartite subgraph polytope (Q1199475) (← links)
• Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
• Collapsing and lifting for the cut cone (Q1322220) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← 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)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
• Application of cut polyhedra. I (Q1891019) (← links)
• Facets of the \(k\)-partition polytope (Q1897366) (← links)
• On the partial order polytope of a digraph (Q1915807) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
• Facets from gadgets (Q2220662) (← links)
• The partition problem (Q2366610) (← links)
• Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• Composition of facets of the clique partitioning polytope (Q3972001) (← links)
• Complete descriptions of small multicut polytopes (Q3974969) (← links)
• (Q4242935) (← links)
• The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)
• On the dominant of the multicut polytope (Q6624194) (← links)