A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2011.06.005
@@ Property / DOI: 10.1016/j.cor.2011.06.005 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2163516551
@@ Property / OpenAlex ID: W2163516551 / rank @@
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Center and distinguisher for strings with unbounded alphabet
+Normal rank
@@ Property / cites work @@
+On the closest string and substring problems
@@ Property / cites work: On the closest string and substring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank
@@ Property / cites work @@
+Optimal Solutions for the Closest-String Problem via Integer Programming
+Normal rank
@@ Property / cites work @@
+A parallel multistart algorithm for the closest string problem
+Normal rank
@@ Property / cites work @@
+A user's guide to tabu search
@@ Property / cites work: A user's guide to tabu search / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2011.06.005
@@ Property / DOI: 10.1016/J.COR.2011.06.005 / rank @@
+Normal rank