A faster FPTAS for knapsack problem with cardinality constraint (Q5918631): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for hard capacitated \(k\)-facility location problems
+Normal rank
@@ Property / cites work @@
+A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Q5240419
@@ Property / cites work: Q5240419 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with general cost structures
@@ Property / cites work: Bin packing with general cost structures / rank @@
+Normal rank
@@ Property / cites work @@
+Truthful Data Quality Elicitation for Quality-Aware Data Crowdsourcing
+Normal rank
@@ Property / cites work @@
+On PreemptiveResource Constrained Scheduling:   Polynomial-Time  Approximation Schemes
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Approximation Schemes for Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 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 Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for some separable quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
+Normal rank