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

DOI10.1023/B:JOCO.0000021938.49750.91zbMath1136.90495MaRDI QIDQ1768600

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

heuristics; dynamic programming; depth-first search; cutting stock; hill-climbing; knapsacking

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

90C27: Combinatorial optimization

90C39: Dynamic programming

Related Items

A block-based layer building approach for the 2D guillotine strip packing problem, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, A recursive algorithm for constrained two-dimensional cutting problems, Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study, Exact algorithms for the two-dimensional guillotine knapsack, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming