A branch and bound algorithm for the maximum diversity problem (Q2379521): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2008.12.023
+Normal rank
@@ Property / OpenAlex ID @@
+W1991805259
@@ Property / OpenAlex ID: W1991805259 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search and GRASP for the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Hybrid heuristics for the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Computational aspects of the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
+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 @@
+Heuristic algorithms for the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Q5393829
@@ Property / cites work: Q5393829 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated tabu search for the maximum diversity problem
+Normal rank