A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Annals of Operations Research

• Publication date

  2010-09-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/S10479-008-0457-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns

  2008cited by this paper
• An improved typology of cutting and packing problems

  2007cited by this paper
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

  2006cited by this paper
• Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

  2006cited by this paper
• Non Delayed Relax-and-Cut Algorithms

  2005cited by this paper
• Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems

  2004cited by this paper
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

  2004cited by this paper
• Cutting and Packing Problems

  2002cited by this paper
• Two-dimensional packing problems: A survey

  2002cited by this paper
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

  2002cited by this paper
• Phi-functions for primary 2D-objects

  2002cited by this paper
• Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithm

  2000cited by this paper
• A comparative numerical analysis for the guillotine two-dimensional cutting problem

  2000cited by this paper
• Solution for the constrained guillotine cutting problem by simulated annealing

  1998cited by this paper
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems

  1998influential reference
• An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock

  1997cited by this paper
• The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems

  1997influential reference
• A cutting stock procedure for printed circuit board production

  1997cited by this paper
• Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach

  1996cited by this paper
• A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

  1995cited by this paper
• Cutting and packing

  1995cited by this paper
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts

  1995influential reference
• The DH/KD Algorithm: A Hybrid Approach for Unconstrained Cutting Problems

  1995cited by this paper
• Exact solutions for constrained two-dimensional cutting problems

  1995cited by this paper
• An AND/OR-graph Approach to the Container Loading Problem

  1994cited by this paper
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems

  1993influential reference
• Cutting and Packing in Production and Distribution

  1992cited by this paper
• An and—or-graph approach for two-dimensional cutting problems

  1992cited by this paper
• On a Research Bibliography for Cutting and Packing Problems

  1992cited by this paper
• Cutting and packing in production and distribution : a typology and bibliography

  1992cited by this paper
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

  1992cited by this paper
• A typology of cutting and packing problems

  1990cited by this paper
• An improved version of Wang's algorithm for two-dimensional cutting problems

  1990cited by this paper
• A computational improvement to Wang's two-dimensional cutting stock algorithm

  1989cited by this paper
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

  1985cited by this paper
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

  1983influential reference
• State-space relaxation procedures for the computation of bounds to routing problems

  1981cited by this paper
• An Algorithm for Two-Dimensional Cutting Problems

  1977influential reference
• The Theory and Computation of Knapsack Functions

  1966cited by this paper

• EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints

  2025cites this paper
• A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects

  2025cites this paper
• Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem

  2023cites this paper
• An introduction to the two-dimensional rectangular cutting and packing problem

  2022cites this paper
• Strip based compact formulation for two-dimensional guillotine cutting problems

  2022cites this paper
• 2DPackLib: a two-dimensional cutting and packing library

  2021cites this paper
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem

  2020cites this paper
• Exact solution techniques for two-dimensional cutting and packing

  2020cites this paper
• A top-down cutting approach for modeling the constrained two- and three-dimensional guillotine cutting problems

  2020cites this paper
• Multivariate Investigation of NP-Hard Problems: Boundaries Between Parameterized Tractability and Intractability

  2020cites this paper
• An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems

  2020influential citation
• Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

  2019cites this paper
• A Quick Heuristic-Dynamic Programming for Two-Dimensional Cutting Problem

  2019cites this paper
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

  2019cites this paper
• Improved state space relaxation for constrained two-dimensional guillotine cutting problems

  2019influential citation
• A Block Corner-Occupying Heuristic Algorithm for Constrained Two-Dimensional Guillotine Cutting Problem of Rectangular Items

  2019cites this paper
• Efficient Heuristics for Two-Dimensional Cutting and Packing Problems

  2019cites this paper
• The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm

  2019cites this paper
• A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts

  2019cites this paper
• Contributions to the two-dimensional guillotine cutting stock problem

  2018cites this paper
• Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem

  2018cites this paper
• An Exact Rectangular Two-Segment Layout Algorithm with Optimal Same-Shape Strip Generation

  2018cites this paper
• Tractability, hardness, and kernelization lower bound for and/or graph solution

  2017cites this paper
• And/or-convexity: a graph convexity based on processes and deadlock models

  2017cites this paper
• A column generation-based algorithm for two-stage, two-dimensional bin packing problem with a variant variable sized constraint

  2017cites this paper
• Upper Bounds Categorization for Constrained Two-Dimensional Guillotine Cutting

  2017cites this paper
• Complexity and algorithms related to two classes of graph problems

  2017cites this paper
• Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem

  2016cites this paper
• An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem

  2016cites this paper
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover

  2016cites this paper
• Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

  2015cites this paper
• A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size

  2015cites this paper
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem

  2015cites this paper
• HEURISTICADEDOS-ETAPASPARAELPROBLEMADE CORTEDEPIEZASCONGUILLOTINADOBIDIMENSIONAL ♠

  2014cites this paper
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects

  2014cites this paper
• An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem

  2013cites this paper
• Problema de programação de uma operação de empacotamento não-guilhotinado em ambiente de máquina única, minimizando custos de matéria-prima e desvio de datas: formulação e solução heurística.

  2013cites this paper
• Modelos lineares e não lineares inteiros para problemas da mochila bidimensional restrita a 2 estágios

  2013cites this paper
• Two-stage two-dimensional guillotine cutting problems with usable leftovers ∗

  2013cites this paper
• Heuristic for two-dimensional homogeneous two-segment cutting patterns

  2013cites this paper
• Problemas de corte com sobras aproveitáveis e eliminação de simetrias

  2012cites this paper
• Fast heuristic for constrained homogenous T-shape cutting patterns

  2012cites this paper
• Simple heuristic for the constrained two-dimensional cutting problem

  2012cites this paper
• Revisiting the complexity of and/or graph solution

  2012cites this paper
• Parameterized Complexity News 3 Parameterized Complexity and Nash Equilibrium

  year unknowncites this paper