Pages that link to "Item:Q628745"

The following pages link to Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745):

Displaying 10 items.

• Column generation bounds for numerical microaggregation (Q486386) (← links)
• Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
• A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• New heuristic for harmonic means clustering (Q887198) (← links)
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
• The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
• The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)