Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (Q2892309): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58826439, #quickstatements; #temporary_batch_1719407511203
Import241208061232 (talk | contribs)
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1287/ijoc.1060.0181 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1287/IJOC.1060.0181 / rank
 
Normal rank

Revision as of 03:38, 20 December 2024

scientific article
Language Label Description Also known as
English
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
scientific article

    Statements

    Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem (English)
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    integer programming
    0 references
    branch and bound
    0 references
    cutting plane
    0 references
    production-scheduling
    0 references
    cutting stock
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references