Pages that link to "Item:Q497678"
From MaRDI portal
The following pages link to Bin packing with fragmentable items: presentation and approximations (Q497678):
Displaying 18 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Column generation for the variable cost and size bin packing problem with fragmentation (Q510930) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Complexity of fragmentable object bin packing and an application (Q1608419) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- Online bin packing of fragile objects with application in cellular networks (Q2426651) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- Bin packing with restricted item fragmentation (Q2786902) (← links)
- On Packing Splittable Items with Cardinality Constraints (Q3163876) (← links)
