Algorithms with guarantee value for knapsack problems (Q2903135): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2011.617818
+Normal rank
@@ Property / OpenAlex ID @@
+W2002467715
@@ Property / OpenAlex ID: W2002467715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Heuristic Algorithms
@@ Property / cites work: Worst-Case Analysis of Heuristic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for large unbounded knapsack problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2903135