Class constrained bin covering (Q970104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for ordered vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for a dual version of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin covering with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic fully polynomial time approximation scheme for bin covering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two class-constrained versions of the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for class-constrained packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online class-constrained packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Class Constrained Bin Packing Problem with Applications to Video-on-Demand / rank
 
Normal rank

Revision as of 19:12, 2 July 2024

scientific article
Language Label Description Also known as
English
Class constrained bin covering
scientific article

    Statements

    Identifiers