A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
From MaRDI portal
Publication:646707
Recommendations
- Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- scientific article; zbMATH DE number 3991298
Cites work
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- CSDP, A C library for semidefinite programming
- Facets of the \(k\)-partition polytope
- Geometry of cuts and metrics
- Graph partitioning using linear and semidefinite programming
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Minimizing breaks by maximizing cuts.
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- On the Shannon capacity of a graph
- On the cut polytope
- Orbitopal Fixing
- Realignment in the National Football League: Did they do it right?
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The partition problem
Cited in
(34)- SDP-based bounds for graph partition via extended ADMM
- Conic approximation to quadratic optimization with linear complementarity constraints
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- A two-level graph partitioning problem arising in mobile wireless communications
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- SDP relaxations for some combinatorial optimization problems
- Computational approaches to MAX-cut
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Orbitopal fixing
- Projection results for the \(k\)-partition problem
- A framework for solving mixed-integer semidefinite programs
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Robust critical node selection by Benders decomposition
- Exploiting sparsity for the min \(k\)-partition problem
- Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- A multiple search operator heuristic for the max-k-cut problem
- On semidefinite programming relaxations of maximum \(k\)-section
- A computational study for bilevel quadratic programs using semidefinite relaxations
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- An efficient semidefinite programming relaxation for the graph partition problem
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- Engineering branch-and-cut algorithms for the equicut problem
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- New formulations for the conflict resolution problem in the scheduling of television commercials
This page was built for publication: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646707)
