Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems

DOI10.1023/B:JOCO.0000021938.49750.91MaRDI QIDQ1768600zbMATH OpenOpenAlexFDO

Authors Mhand Hifi

Publication date 15 March 2005

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:joco.0000021938.49750.91

zbMATH Keywords

heuristicsdynamic programmingdepth-first searchcutting stockhill-climbingknapsacking

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39) Production models (90B30)

Recommendations

• Efficient algorithm for the constrained two-dimensional cutting stock problem
• scientific article; zbMATH DE number 3932795
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• The two-dimensional cutting stock problem revisited
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• An approach to two-dimensional cutting stock problems
• A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

Cited in

(17)

• Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
• Improved state space relaxation for constrained two-dimensional guillotine cutting problems
• Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
• A block-based layer building approach for the 2D guillotine strip packing problem
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Modeling two-dimensional guillotine cutting problems via integer programming
• Exact algorithms for the two-dimensional guillotine knapsack
• A recursive algorithm for constrained two-dimensional cutting problems
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
• scientific article; zbMATH DE number 3932795 (Why is no real title available?)
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

This page was built for publication: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768600)