A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-021-00999-z
@@ Property / DOI: 10.1007/s10898-021-00999-z / rank @@
-Normal rank
@@ Property / cites work @@
+Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
+Normal rank
@@ Property / cites work @@
+Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
+Normal rank
@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs
+Normal rank
@@ Property / cites work @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the \(k\)-partition polytope
@@ Property / cites work: Facets of the \(k\)-partition polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
+Normal rank
@@ Property / cites work @@
+Computational study of valid inequalities for the maximum \(k\)-cut problem
+Normal rank
@@ Property / cites work @@
+Q4737533
@@ Property / cites work: Q4737533 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
+Normal rank
@@ Property / cites work @@
+Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
+Normal rank
@@ Property / cites work @@
+Improved semidefinite bounding procedure for solving max-cut problems to optimality
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity for the min \(k\)-partition problem
+Normal rank
@@ Property / cites work @@
+Alternating direction augmented Lagrangian methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for the graph partitioning problem
+Normal rank
@@ Property / cites work @@
+A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
+Normal rank
@@ Property / DOI @@
+.1007/S10898-021-00999-Z
@@ Property / DOI: 10.1007/S10898-021-00999-Z / rank @@
+Normal rank