The following pages link to (Q4400850):
Displaying 14 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- The fully polynomial approximation algorithm for the 0-1 knapsack problem (Q699820) (← links)
- Improved algorithms for two single machine scheduling problems (Q860871) (← links)
- On the machine scheduling problem with job delivery coordination (Q884029) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521) (← links)
- (Q4458134) (← links)
- (Q4636439) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)