Pages that link to "Item:Q1015303"
From MaRDI portal
The following pages link to Hardness of lazy packing and covering (Q1015303):
Displayed 6 items.
- On lazy bin covering and packing problems (Q1041247) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)