Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2004.09.016
@@ Property / DOI: 10.1016/j.cor.2004.09.016 / rank @@
-Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the multidimensional zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3751378
@@ Property / cites work: Q3751378 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with multiple choice constraints
+Normal rank
@@ Property / cites work @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Q5287558
@@ Property / cites work: Q5287558 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Dynamic tabu list management using the reverse elimination method
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to the multiconstraint zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2004.09.016
@@ Property / DOI: 10.1016/J.COR.2004.09.016 / rank @@
+Normal rank