Multiheuristic approach to discrete optimization problems (Q2371698): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-006-0070-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2055477049
@@ Property / OpenAlex ID: W2055477049 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365133
@@ Property / cites work: Q4365133 / rank @@
+Normal rank
@@ Property / cites work @@
+On the State Minimization of Nondeterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519038
@@ Property / cites work: Q4519038 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2761606
@@ Property / cites work: Q2761606 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for determining relative star height and star height
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics in programming of nondeterministic games
+Normal rank
@@ Property / cites work @@
+A choice of strategy in nondeterministic antagonistic games
+Normal rank