A new global algorithm for max-cut problem with chordal sparsity (Q6103705): Difference between revisions

@@ Property / DOI @@
-.1007/s10957-023-02195-3
@@ Property / DOI: 10.1007/s10957-023-02195-3 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10957-023-02195-3
+Normal rank
@@ Property / OpenAlex ID @@
+W4360998224
@@ Property / OpenAlex ID: W4360998224 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Facets of the Bipartite Subgraph Polytope
@@ Property / cites work: Facets of the Bipartite Subgraph Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-price procedure for clustering data that are graph connected
+Normal rank
@@ Property / cites work @@
+Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
+Normal rank
@@ Property / cites work @@
+Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
+Normal rank
@@ Property / cites work @@
+Q5272625
@@ Property / cites work: Q5272625 / rank @@
+Normal rank
@@ Property / cites work @@
+What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
+Normal rank
@@ Property / cites work @@
+A two-level graph partitioning problem arising in mobile wireless communications
+Normal rank
@@ Property / cites work @@
+Randomized heuristics for the Max-Cut problem
@@ Property / cites work: Randomized heuristics for the Max-Cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
+Normal rank
@@ Property / cites work @@
+A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+COSMO: a conic operator splitting method for convex conic problems
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Positive definite completions of partial Hermitian matrices
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
+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 @@
+Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
+Normal rank
@@ Property / cites work @@
+Second order cone programming relaxation of nonconvex quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Q2816028
@@ Property / cites work: Q2816028 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved semidefinite bounding procedure for solving max-cut problems to optimality
+Normal rank
@@ Property / cites work @@
+BiqCrunch
@@ Property / cites work: BiqCrunch / rank @@
+Normal rank
@@ Property / cites work @@
+A MAX-CUT formulation of 0/1 programs
@@ Property / cites work: A MAX-CUT formulation of 0/1 programs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
+Normal rank
@@ Property / cites work @@
+Advanced Scatter Search for the Max-Cut Problem
@@ Property / cites work: Advanced Scatter Search for the Max-Cut Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
+Normal rank
@@ Property / cites work @@
+Solving the max-cut problem using eigenvalues
@@ Property / cites work: Solving the max-cut problem using eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in complex polynomial optimization
+Normal rank
@@ Property / cites work @@
+Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
+Normal rank
@@ Property / cites work @@
+Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
+Normal rank
@@ Property / cites work @@
+Chordal decomposition in operator-splitting methods for sparse semidefinite programs
+Normal rank
@@ Property / DOI @@
+.1007/S10957-023-02195-3
@@ Property / DOI: 10.1007/S10957-023-02195-3 / rank @@
+Normal rank