Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs (Q2784422): Difference between revisions

← Older edit

@@ Property / author @@
-Yin Zhang
@@ Property / author: Yin Zhang / rank @@
-Normal rank
@@ Property / author @@
+Yin Zhang
@@ Property / author: Yin Zhang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/s1052623400382467
+Normal rank
@@ Property / OpenAlex ID @@
+W2051598459
@@ Property / OpenAlex ID: W2051598459 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q4547456
@@ Property / Recommended article: Q4547456 / rank @@
+Normal rank
@@ Property / Recommended article: Q4547456 / qualifier @@
+Similarity Score: 0.95392865Amount 0.95392865
Unit 1
-Amount
+.95392865
 Unit
@@ Property / Recommended article: Q4547456 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
+Normal rank
+Similarity Score: 0.89657944Amount 0.89657944
Unit 1
-Amount
+.89657944
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5483089
@@ Property / Recommended article: Q5483089 / rank @@
+Normal rank
@@ Property / Recommended article: Q5483089 / qualifier @@
+Similarity Score: 0.8913834Amount 0.8913834
Unit 1
-Amount
+.8913834
 Unit
@@ Property / Recommended article: Q5483089 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
+Normal rank
+Similarity Score: 0.8817675Amount 0.8817675
Unit 1
-Amount
+.8817675
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q2934582
@@ Property / Recommended article: Q2934582 / rank @@
+Normal rank
@@ Property / Recommended article: Q2934582 / qualifier @@
+Similarity Score: 0.8790584Amount 0.8790584
Unit 1
-Amount
+.8790584
 Unit
@@ Property / Recommended article: Q2934582 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A rank-two feasible direction algorithm for the binary quadratic programming
+Normal rank
+Similarity Score: 0.87885094Amount 0.87885094
Unit 1
-Amount
+.87885094
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5282656
@@ Property / Recommended article: Q5282656 / rank @@
+Normal rank
@@ Property / Recommended article: Q5282656 / qualifier @@
+Similarity Score: 0.8763318Amount 0.8763318
Unit 1
-Amount
+.8763318
 Unit
@@ Property / Recommended article: Q5282656 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
+Normal rank
+Similarity Score: 0.87551284Amount 0.87551284
Unit 1
-Amount
+.87551284
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A tight semidefinite relaxation of the MAX CUT problem
+Normal rank
+Similarity Score: 0.87179965Amount 0.87179965
Unit 1
-Amount
+.87179965
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Quadratic knapsack relaxations using cutting planes and semidefinite programming
+Normal rank
+Similarity Score: 0.8707328Amount 0.8707328
Unit 1
-Amount
+.8707328
 Unit
+Recommender Run: Recommender Run 2