Semidefinite programming based approaches to the break minimization problem (Q2583777): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2004.09.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2078281801
@@ Property / OpenAlex ID: W2078281801 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2751584
@@ Property / cites work: Q2751584 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2779815
@@ Property / cites work: Q2779815 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing breaks by maximizing cuts.
@@ Property / cites work: Minimizing breaks by maximizing cuts. / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm to find an equitable home--away assignment
+Normal rank
@@ Property / cites work @@
+NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
+Normal rank
@@ Property / cites work @@
+Q4737518
@@ Property / cites work: Q4737518 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
+Normal rank