Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881): Difference between revisions

@@ Property / describes a project that uses @@
+SDP_S
@@ Property / describes a project that uses: SDP_S / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10288-012-0210-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2150305542
@@ Property / OpenAlex ID: W2150305542 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3429015
@@ Property / cites work: Q3429015 / rank @@
+Normal rank
@@ Property / cites work @@
+A semidefinite optimization approach for the single-row layout problem with unequal dimensions
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+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 @@
+Experiments in quadratic 0-1 programming
@@ Property / cites work: Experiments in quadratic 0-1 programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for the Quadratic Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+An SDP approach to multi-level crossing minimization
+Normal rank
@@ Property / cites work @@
+Aspects of semidefinite programming. Interior point algorithms and selected applications
+Normal rank
@@ Property / cites work @@
+On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
+Normal rank
@@ Property / cites work @@
+The cut polytope and the Boolean quadric polytope
@@ Property / cites work: The cut polytope and the Boolean quadric polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian eigenvalues and the maximum cut problem
@@ Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+The hypermetric cone is polyhedral
@@ Property / cites work: The hypermetric cone is polyhedral / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236244
@@ Property / cites work: Q3236244 / 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 @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+Fixing Variables in Semidefinite Relaxations
@@ Property / cites work: Fixing Variables in Semidefinite Relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming
@@ Property / cites work: Semidefinite programming / rank @@
+Normal rank
@@ Property / cites work @@
+Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
+Normal rank
@@ Property / cites work @@
+Semidefinite representation of convex sets
@@ Property / cites work: Semidefinite representation of convex sets / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations of ordering problems
@@ Property / cites work: Semidefinite relaxations of ordering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum graph partitioning problems
+Normal rank
@@ Property / cites work @@
+-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
+Normal rank
@@ Property / cites work @@
+Q4400639
@@ Property / cites work: Q4400639 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Q3395491
@@ Property / cites work: Q3395491 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5292090
@@ Property / cites work: Q5292090 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407449
@@ Property / cites work: Q4407449 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Solving \(k\)-cluster problems to optimality with semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+Bounds for the quadratic assignment problem using the bundle method
+Normal rank
@@ Property / cites work @@
+From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of semidefinite programming. Theory, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
+Normal rank