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 10 items.
- 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)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)