A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4382664 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Three-Dimensional Bin Packing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / rank | |||
Normal rank |
Revision as of 08:41, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for the non-oriented two-dimensional bin packing problem |
scientific article |
Statements
A lower bound for the non-oriented two-dimensional bin packing problem (English)
0 references
15 May 2002
0 references
cutting and packing
0 references
lower bound
0 references
branch-and-bound
0 references
0 references