Pages that link to "Item:Q5444986"
From MaRDI portal
The following pages link to Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs (Q5444986):
Displaying 9 items.
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← 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)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- The basic train makeup problem in shunting yards (Q5964852) (← links)
