An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57185911, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming / 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: Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to a two-stage cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setup minimising conditions in the trim loss problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing techniques for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / 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: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search for the Three-Dimensional Bin-Packing Problem / 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: A Linear Programming Approach to the Cutting Stock Problem—Part II / 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: Optimal solutions for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential heuristic procedure for one-dimensional cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock problems and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Stock and Scheduling Problem in the Copper Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On genetic algorithms for the packing of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for the oriented 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: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern minimisation in cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined cutting-stock and lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random search in the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One Dimensional Cutting Stock Problem Using Two Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock decisions for rolls with multiple quality grades / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to cutting stock problems with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row and column generation technique for a multistage cutting stock problem / rank
 
Normal rank

Revision as of 21:24, 24 June 2024

scientific article
Language Label Description Also known as
English
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
scientific article

    Statements

    An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (English)
    0 references
    0 references
    27 October 2006
    0 references
    cutting stock problem
    0 references
    multiple objectives
    0 references
    iterative sequential heuristic
    0 references
    0 references
    0 references
    0 references

    Identifiers