A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174): Difference between revisions

@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the set covering problem
@@ Property / cites work: A genetic algorithm for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple-choice multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Minimax resource allocation problems: Optimization and parametric analysis
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A min-max resource allocation problem with substitutions
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
+Normal rank