Pages that link to "Item:Q2175445"

The following pages link to Exploiting sparsity for the min \(k\)-partition problem (Q2175445):

Displaying 7 items.

• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← 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)
• Sparsity of integer formulations for binary programs (Q2294334) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)