Pages that link to "Item:Q342176"
From MaRDI portal
The following pages link to Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176):
Displaying 11 items.
- Identifying industrial clusters with a novel big-data methodology: are SIC codes (not) fit for purpose in the internet age? (Q1651685) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- A novel optimization approach towards improving separability of clusters (Q6164339) (← links)
- On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)
