A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.mcm.2011.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037068211 / 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: An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting 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: Strip generation algorithms for constrained two-dimensional two-staged cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for generating homogeneous T-shape cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating optimal two-section cutting patterns for rectangular blanks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting / 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: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions for constrained two-dimensional cutting problems / 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: Q4821303 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:44, 4 July 2024

scientific article
Language Label Description Also known as
English
A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
scientific article

    Statements

    A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (English)
    0 references
    0 references
    0 references
    18 December 2011
    0 references
    two-dimensional cutting
    0 references
    cutting stock
    0 references
    T-shape patterns
    0 references
    0 references

    Identifiers