Pages that link to "Item:Q2673248"

The following pages link to Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248):

Displaying 12 items.

• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)