Computational results of a semidefinite branch-and-bound algorithm for k-cluster
From MaRDI portal
Publication:342176
DOI10.1016/J.COR.2015.07.008zbMATH Open1349.90715OpenAlexW1457372680MaRDI QIDQ342176FDOQ342176
Recommendations
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
Cites Work
- A Limited Memory Algorithm for Bound Constrained Optimization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Approximation algorithms for maximization problems arising in graph partitioning
- CSDP, A C library for semidefinite programming
- Clustering and domination in perfect graphs
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- On weighted vs unweighted versions of combinatorial optimization problems
- Partial Lagrangian relaxation for general quadratic programming
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Strong Duality for Semidefinite Programming
- The discrete p-dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
Cited In (17)
- A novel optimization approach towards improving separability of clusters
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
- Recent Advances in Constraints
- Identifying industrial clusters with a novel big-data methodology: are SIC codes (not) fit for purpose in the internet age?
- Evaluation of a Branch and Bound Algorithm for Clustering
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- LP-based dual bounds for the maximum quasi-clique problem
- On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- On solving the densest \(k\)-subgraph problem on large graphs
- New diagonal bundle method for clustering problems in large data sets
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
This page was built for publication: Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342176)
