A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2006.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029137835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / 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: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact method for the two-dimensional orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for bounds for higher-dimensional orthogonal 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Revision as of 14:39, 27 June 2024

scientific article
Language Label Description Also known as
English
A new exact method for the two-dimensional bin-packing problem with fixed orientation
scientific article

    Statements

    A new exact method for the two-dimensional bin-packing problem with fixed orientation (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    cutting and packing
    0 references
    branch-and-bound
    0 references
    lower bounds
    0 references
    dual-feasible functions
    0 references

    Identifiers