Heuristic algorithms for the maximum diversity problem (Q4398552): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02522667.1998.10699366
+Normal rank
@@ Property / OpenAlex ID @@
+W2026342695
@@ Property / OpenAlex ID: W2026342695 / rank @@
+Normal rank
@@ Property / cites work @@
+Large-scale controlled rounding using tabu search with strategic oscillation
+Normal rank
@@ Property / cites work @@
+Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
+Normal rank
@@ Property / cites work @@
+Dynamic tabu list management using the reverse elimination method
+Normal rank
@@ Property / cites work @@
+Computational aspects of the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
+Normal rank
@@ Property / cites work @@
+A discrete optimization model for preserving biological diversity
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079017
@@ Property / cites work: Q4079017 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search for a class of scheduling problems
@@ Property / cites work: Tabu search for a class of scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Diversity
@@ Property / cites work: On Diversity / rank @@
+Normal rank