A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047): Difference between revisions

@@ Property / author @@
+Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / 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.1080/10556788.2013.833616
+Normal rank
@@ Property / OpenAlex ID @@
+W2067948622
@@ Property / OpenAlex ID: W2067948622 / rank @@
+Normal rank
@@ Property / cites work @@
+A three-string approach to the closest string problem
+Normal rank
@@ Property / cites work @@
+Improved LP-based algorithms for the closest string problem
+Normal rank
@@ Property / cites work @@
+Center and distinguisher for strings with unbounded alphabet
+Normal rank
@@ Property / cites work @@
+Efficient solutions for the far from most string problem
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel multistart algorithm for the closest string problem
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+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 @@
+Exact algorithm and heuristic for the closest string problem
+Normal rank
@@ Property / cites work @@
+Mersenne twister
@@ Property / cites work: Mersenne twister / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Solutions for the Closest-String Problem via Integer Programming
+Normal rank
@@ Property / cites work @@
+A GRASP algorithm for the closest string problem using a probability-based heuristic
+Normal rank
@@ Property / cites work @@
+Q4004140
@@ Property / cites work: Q4004140 / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm based on Lagrangian relaxation for the closest string problem
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank