The following pages link to (Q5240419):
Displaying 20 items.
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- The fully polynomial approximation algorithm for the 0-1 knapsack problem (Q699820) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems (Q3556579) (← links)
- Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem (Q3796962) (← links)
- (Q5091235) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
