The following pages link to (Q3320130):
Displaying 30 items.
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- On the computational complexity of reliability redundancy allocation in a series system (Q1196218) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- The preemptive stochastic resource-constrained project scheduling problem (Q1735185) (← links)
- A streamlined proof of Goodwillie's \(n\)-excisive approximation (Q1948308) (← links)
- The approximating capability of fast forms (Q1971592) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Multistage knapsack (Q2119404) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- (Q3375704) (← links)
- New applications of partial orders (Q3714902) (← links)
- (Q3814635) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- (Q5092381) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)
