Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time constrained scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank

Latest revision as of 18:52, 7 June 2024

scientific article
Language Label Description Also known as
English
Heuristics and lower bounds for the bin packing problem with conflicts
scientific article

    Statements