Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259): Difference between revisions

@@ Property / author @@
-Dieter Jungnickel
@@ Property / author: Dieter Jungnickel / rank @@
-Normal rank
@@ Property / author @@
+Dieter Jungnickel
@@ Property / author: Dieter Jungnickel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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 @@
+Approximation algorithms for the capacitated plant allocation problem
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1977259