Pages that link to "Item:Q3083324"
From MaRDI portal
The following pages link to AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items (Q3083324):
Displaying 22 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- Bin covering with cardinality constraints (Q2446840) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- (Q5111695) (← links)
- On the generalized bin packing problem (Q5278218) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
