A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380): 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 / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive exact algorithm for weighted two-dimensional 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: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts / 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: Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An and-or-graph approach for two-dimensional cutting problems / 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: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of Wang's algorithm for two-dimensional cutting problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:02, 4 June 2024

scientific article; zbMATH DE number 1723859
Language Label Description Also known as
English
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
scientific article; zbMATH DE number 1723859

    Statements

    A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting stock problem
    0 references
    heuristics
    0 references
    knapsack problem
    0 references
    GRASP
    0 references
    tabu search
    0 references
    path relinking
    0 references
    0 references
    0 references