Class constrained bin covering
From MaRDI portal
Publication:970104
Recommendations
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1875408 (Why is no real title available?)
- scientific article; zbMATH DE number 1445307 (Why is no real title available?)
- Algorithms for on-line bin-packing problems with cardinality constraints
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Approximation schemes for ordered vector packing problems
- Better approximation algorithms for bin covering
- Bin covering with cardinality constraints
- On a dual version of the one-dimensional bin packing problem
- On two class-constrained versions of the multiple knapsack problem
- Online algorithms for a dual version of bin packing
- Polynomial time approximation schemes for class-constrained packing problems
- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
- Tight bounds for online class-constrained packing
Cited in
(7)- Online bin covering with limited migration
- Bin covering with cardinality constraints
- Colored bin packing: online algorithms and lower bounds
- Class constrained bin packing revisited
- Online Bin Covering with Limited Migration
- On the sum minimization version of the online bin covering problem
- Lower bounds and algorithms for the minimum cardinality bin covering problem
This page was built for publication: Class constrained bin covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970104)
