An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.ejor.2010.01.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044897000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear Programming Approach to the Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and bounds for two-dimensional level 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: Models and algorithms for three-stage two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 21:43, 2 July 2024

scientific article
Language Label Description Also known as
English
An integer programming model for two- and three-stage two-dimensional cutting stock problems
scientific article

    Statements

    An integer programming model for two- and three-stage two-dimensional cutting stock problems (English)
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    cutting
    0 references
    2D rectangular SSSCSP with guillotine constraints
    0 references
    integer programming
    0 references
    length of the cutting operations
    0 references

    Identifiers