Pages that link to "Item:Q927410"
From MaRDI portal
The following pages link to Approximation schemes for packing with item fragmentation (Q927410):
Displaying 15 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Complexity of fragmentable object bin packing and an application (Q1608419) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
- New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
- Analysis of transmissions scheduling with packet fragmentation (Q2752461) (← links)
- On Packing Splittable Items with Cardinality Constraints (Q3163876) (← links)
- The basic train makeup problem in shunting yards (Q5964852) (← links)