Exploiting sparsity for the min \(k\)-partition problem (Q2175445): Difference between revisions

@@ Property / DOI @@
-.1007/s12532-019-00165-3
@@ Property / DOI: 10.1007/s12532-019-00165-3 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Gravity
@@ Property / describes a project that uses: Gravity / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ComputeTW
@@ Property / describes a project that uses: ComputeTW / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Rudy
@@ Property / describes a project that uses: Rudy / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963760933
@@ Property / OpenAlex ID: W2963760933 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00485
@@ Property / arXiv ID: 1709.00485 / rank @@
+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 @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Convex and concave envelopes: revisited and new perspectives
+Normal rank
@@ Property / cites work @@
+Q5603088
@@ Property / cites work: Q5603088 / rank @@
+Normal rank
@@ Property / cites work @@
+LP Formulations for Polynomial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Tree-width and the Sherali-Adams operator
@@ Property / cites work: Tree-width and the Sherali-Adams operator / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth computations. I: Upper bounds
@@ Property / cites work: Treewidth computations. I: Upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Interaction Cost
@@ Property / cites work: Scheduling to Minimize Interaction Cost / 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 @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3974969
@@ Property / cites work: Q3974969 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Web Facets for Multicut Polytopes
@@ Property / cites work: Clique-Web Facets for Multicut Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737533
@@ Property / cites work: Q4737533 / rank @@
+Normal rank
@@ Property / cites work @@
+Projection results for the \(k\)-partition problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+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 @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Positive definite completions of partial Hermitian matrices
+Normal rank
@@ Property / cites work @@
+Orbitopal fixing
@@ Property / cites work: Orbitopal fixing / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
+Normal rank
@@ Property / cites work @@
+Q2816028
@@ Property / cites work: Q2816028 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
+Normal rank
@@ Property / cites work @@
+A connection between positive semidefinite and Euclidean distance matrix completion problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
+Normal rank
@@ Property / cites work @@
+Computational study of valid inequalities for the maximum \(k\)-cut problem
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank
@@ Property / cites work @@
+A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127597281
@@ Property / Wikidata QID: Q127597281 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S12532-019-00165-3
@@ Property / DOI: 10.1007/S12532-019-00165-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2175445