Pages that link to "Item:Q2570998"
From MaRDI portal
The following pages link to An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998):
Displaying 11 items.
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Fast approximate PCPs for multidimensional bin-packing problems (Q1767978) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- (Q3720294) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451) (← links)