Hybrid rounding techniques for knapsack problems (Q2489957): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2159846562
@@ Property / OpenAlex ID: W2159846562 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cs/0305002
@@ Property / arXiv ID: cs/0305002 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4400850
@@ Property / cites work: Q4400850 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Hybrid rounding techniques for knapsack problems
@@ Property / cites work: Hybrid rounding techniques for knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for some separable quadratic programming problems
+Normal rank