Pages that link to "Item:Q2231324"

The following pages link to A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324):

Displaying 14 items.

• Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
• An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
• Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
• A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
• Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• A branch \& cut algorithm for the maximum common edge subgraph problem (Q2840513) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)