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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.1060.0181 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 864 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
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.1287/ijoc.1060.0181 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140631835 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58826439 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.1060.0181 / rank
 
Normal rank

Latest 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