Applying simulated annealing using different methods for the neighborhood search in forest planning problems (Q297021): Difference between revisions

@@ Property / cites work @@
+Even-aged restrictions with sub-graph adjacency
@@ Property / cites work: Even-aged restrictions with sub-graph adjacency / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
+Normal rank
@@ Property / cites work @@
+New optimization heuristics. The great deluge algorithm and the record- to-record travel
+Normal rank
@@ Property / cites work @@
+Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part II
@@ Property / cites work: Tabu Search—Part II / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search approach for solving a difficult forest harvesting machine location problem
+Normal rank
@@ Property / cites work @@
+Heuristic solution approaches to operational forest planning problems
+Normal rank
@@ Property / cites work @@
+Optimizing heuristic search in forest planning
@@ Property / cites work: Optimizing heuristic search in forest planning / rank @@
+Normal rank