Prospective Network Flow Models and Algorithms for Bin Packing Problems (Q2883549): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Packing by Bilinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint programming approach for the orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the non-oriented two-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New resolution algorithm and pretreatments for the two-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on two-dimensional bin packing problems / rank
 
Normal rank

Latest revision as of 04:23, 5 July 2024

scientific article
Language Label Description Also known as
English
Prospective Network Flow Models and Algorithms for Bin Packing Problems
scientific article

    Statements

    Identifiers