Restart strategies in optimization: parallel and serial cases (Q632718): Difference between revisions

@@ Property / DOI @@
-.1016/j.parco.2010.08.004
@@ Property / DOI: 10.1016/j.parco.2010.08.004 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.parco.2010.08.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1964514131
@@ Property / OpenAlex ID: W1964514131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4475647
@@ Property / cites work: Q4475647 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal speedup of Las Vegas algorithms
@@ Property / cites work: Optimal speedup of Las Vegas algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An advanced tabu search algorithm for the job shop problem
+Normal rank
@@ Property / cites work @@
+Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
+Normal rank
@@ Property / cites work @@
+Q3998294
@@ Property / cites work: Q3998294 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4367948
@@ Property / cites work: Q4367948 / rank @@
+Normal rank
@@ Property / cites work @@
+Restart technology for solving discrete optimization problems
+Normal rank
@@ Property / cites work @@
+Optimization parallelizing for discrete programming problems
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.PARCO.2010.08.004
@@ Property / DOI: 10.1016/J.PARCO.2010.08.004 / rank @@
+Normal rank