Pages that link to "Item:Q646707"

The following pages link to A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707):

Displaying 8 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Orbitopal fixing (Q408377) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)