Pages that link to "Item:Q1608419"
From MaRDI portal
The following pages link to Complexity of fragmentable object bin packing and an application (Q1608419):
Displaying 9 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← 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 MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
