Pages that link to "Item:Q986543"
From MaRDI portal
The following pages link to Class constrained bin packing revisited (Q986543):
Displaying 16 items.
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Bincoloring (Q954994) (← links)
- Class constrained bin covering (Q970104) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Bin packing under linear constraints (Q1679514) (← links)
- VNS matheuristic for a bin packing problem with a color constraint (Q1687630) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- Variable sized bin packing with color constraints (Q2741495) (← links)
- Bin packing with directed stackability conflicts (Q5501519) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)