A discrete dynamic convexized method for the max-cut problem (Q1761827): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-012-1133-2
@@ Property / DOI: 10.1007/s10479-012-1133-2 / 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/s10479-012-1133-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2023809267
@@ Property / OpenAlex ID: W2023809267 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+Mixed linear and semidefinite programming for combinatorial and quadratic optimization
+Normal rank
@@ Property / cites work @@
+A projected gradient algorithm for solving the maxcut SDP relaxation
+Normal rank
@@ Property / cites work @@
+Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
+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 @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Lagrangian smoothing heuristics for Max-cut
@@ Property / cites work: Lagrangian smoothing heuristics for Max-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
+Normal rank
@@ Property / cites work @@
+A discrete filled function algorithm for approximate global solutions of max-cut problems
+Normal rank
@@ Property / cites work @@
+A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5440597
@@ Property / cites work: Q5440597 / rank @@
+Normal rank
@@ Property / cites work @@
+A continuation algorithm for max-cut problem
@@ Property / cites work: A continuation algorithm for max-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+A discrete dynamic convexized method for nonlinear integer programming
+Normal rank
@@ Property / cites work @@
+Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
+Normal rank
@@ Property / DOI @@
+.1007/S10479-012-1133-2
@@ Property / DOI: 10.1007/S10479-012-1133-2 / rank @@
+Normal rank