Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238): Difference between revisions

@@ 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.1016/j.endm.2014.11.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2056882555
@@ Property / OpenAlex ID: W2056882555 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
+Normal rank
@@ Property / cites work @@
+Q3594048
@@ Property / cites work: Q3594048 / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
+Normal rank
@@ Property / cites work @@
+CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search
@@ Property / cites work: Variable Neighborhood Search / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of binary covering arrays
@@ Property / cites work: A survey of binary covering arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays
+Normal rank