Pages that link to "Item:Q1159134"
From MaRDI portal
The following pages link to A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134):
Displayed 22 items.
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Data dependent worst case bound improving techniques in zero-one programming (Q811361) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Multistage knapsack (Q2119404) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- (Q5092381) (← links)
- Learning-augmented algorithms for online subset sum (Q6064057) (← links)