Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621): Difference between revisions

@@ Property / cites work @@
+The max-cut problem on graphs not contractible to \(K_ 5\)
+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 @@
+Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
+Normal rank
@@ Property / cites work @@
+Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
+Normal rank
@@ Property / cites work @@
+The indefinite zero-one quadratic problem
@@ Property / cites work: The indefinite zero-one quadratic problem / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial properties and the complexity of a max-cut approximation
+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 cut polytope and the Boolean quadric polytope
@@ Property / cites work: The cut polytope and the Boolean quadric polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+The hypermetric cone is polyhedral
@@ Property / cites work: The hypermetric cone is polyhedral / rank @@
+Normal rank
@@ Property / cites work @@
+Application of cut polyhedra. I
@@ Property / cites work: Application of cut polyhedra. I / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of cut polyhedra. II
@@ Property / cites work: Applications of cut polyhedra. II / rank @@
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+.879-approximation algorithms for MAX CUT and MAX 2SAT
+Normal rank
@@ Property / cites work @@
+Some Network Flow Problems Solved with Pseudo-Boolean Programming
+Normal rank
@@ Property / cites work @@
+Roof duality, complementation and persistency in quadratic 0–1 optimization
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+An algorithm for quadratic zero-one programs
@@ Property / cites work: An algorithm for quadratic zero-one programs / rank @@
+Normal rank
@@ Property / cites work @@
+On a positive semidefinite relaxation of the cut polytope
+Normal rank
@@ Property / cites work @@
+On the Facial Structure of the Set of Correlation Matrices
+Normal rank
@@ Property / cites work @@
+Connection between semidefinite relaxations of the max-cut and stable set problems
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5202209
@@ Property / cites work: Q5202209 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
+Normal rank
@@ Property / cites work @@
+The expected relative error of the polyhedral approximation of the max- cut problem
+Normal rank
@@ Property / cites work @@
+Q4840774
@@ Property / cites work: Q4840774 / rank @@
+Normal rank
@@ Property / cites work @@
+Node and edge relaxations of the max-cut problem
@@ Property / cites work: Node and edge relaxations of the max-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Nonpolyhedral Relaxations of Graph-Bisection 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