Models and algorithms for three-stage two-dimensional bin packing (Q2643961): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099303096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / 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: Q4319397 / 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: Models and bounds for two-dimensional level packing problems / 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: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / 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: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 26 June 2024

scientific article
Language Label Description Also known as
English
Models and algorithms for three-stage two-dimensional bin packing
scientific article

    Statements

    Models and algorithms for three-stage two-dimensional bin packing (English)
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    metaheuristics
    0 references
    evolutionary algorithms
    0 references
    hybrid algorithms
    0 references
    0 references
    0 references

    Identifiers