Pages that link to "Item:Q1897366"

The following pages link to Facets of the \(k\)-partition polytope (Q1897366):

Displaying 32 items.

• Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• Orbitopal fixing (Q408377) (← links)
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• On factorization of multiparticle pentagons (Q906695) (← links)
• Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
• Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
• Signed orders, choice probabilities, and linear polytopes (Q1598972) (← 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)
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← 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)
• A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
• The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
• Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• Facets of the weak order polytope derived from the induced partition projection (Q2784506) (← links)
• The polytope of block diagonal matrices and complete bipartite partitionings (Q4369763) (← links)
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
• Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number (Q6050732) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)