Pages that link to "Item:Q1751250"

The following pages link to Projection results for the \(k\)-partition problem (Q1751250):

Displaying 15 items.

• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
• The \(k\)-partitioning problem (Q1298757) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
• Recovering nonuniform planted partitions via iterated projection (Q2002551) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
• Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)