Pages that link to "Item:Q4114965"
From MaRDI portal
The following pages link to Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (Q4114965):
Displayed 20 items.
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube (Q375961) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Optimal and efficient adaptation in distributed real-time systems with discrete rates (Q483961) (← links)
- Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742) (← links)