Online variable-sized bin packing with conflicts (Q429693): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new version of on-line variable-sized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on grid processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time constrained scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bin Packing with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the subset sum algorithm for bin packing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric packing of selfish items and the subset sum algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank

Latest revision as of 09:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Online variable-sized bin packing with conflicts
scientific article

    Statements