Pages that link to "Item:Q818116"
From MaRDI portal
The following pages link to Approximation schemes for knapsack problems with shelf divisions (Q818116):
Displaying 9 items.
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems (Q1333241) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM (Q3575375) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)