Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (Q2830956): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59195714, #quickstatements; #temporary_batch_1712190744730
Created claim: DBLP publication ID (P1635): journals/informs/BoschettiMS16, #quickstatements; #temporary_batch_1731530891435
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving knapsack problems on GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving path problems on the GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / 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: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/informs/BoschettiMS16 / rank
 
Normal rank

Latest revision as of 22:19, 13 November 2024

scientific article
Language Label Description Also known as
English
Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
scientific article

    Statements

    Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (English)
    0 references
    1 November 2016
    0 references
    combinatorial optimization problems
    0 references
    cutting problems
    0 references
    dynamic programming
    0 references
    parallel computing
    0 references
    GPU computing
    0 references
    CUDA
    0 references
    0 references
    0 references

    Identifiers