Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Workshop on Engineering Applications

• Publication date

  2004-05-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-24838-5_13
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• New approximability and inapproximability results for 2-dimensional Bin Packing

  2004cited by this paper
• Approximation schemes for multidimensional packing

  2004cited by this paper
• Parametric on-line algorithms for packing rectangles and boxes

  2003cited by this paper
• New Bounds for Multidimensional Packing

  2003cited by this paper
• Packing 2-dimensional bins in harmony

  2002cited by this paper
• Multidimensional Cube Packing

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

  2000cited by this paper
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

  2000cited by this paper
• Heuristics for the integer one-dimensional cutting stock problem: A computational study

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems

  1995cited by this paper
• Instituto de Matemática e Estatística

  1994cited by this paper
• An on-line algorithm for multidimensional bin packing

  1993cited by this paper
• Generalized First-Fit Algorithms in Two and Three Dimensions

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

  1990cited by this paper
• OR-Library: Distributing Test Problems by Electronic Mail

  1990cited by this paper
• A probabilistic analysis of the simplex method

  1986cited by this paper
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

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

  1985influential reference
• New results on the average behavior of simplex algorithms

  1984cited by this paper
• On Packing Two-Dimensional Bins

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

  1977cited by this paper
• Recursive computational procedure for two-dimensional stock cutting

  1972cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper

• Contribution to Solving a Two-Dimensional Cutting Stock Problem with Two Objectives

  2022cites this paper
• Balanced approach for the two-dimensional rectangular guillotine cutting stock problem with setup cost

  2018cites this paper
• Automotive Industry Line Board Optimization Through Operations Research Techniques

  2018influential citation
• An EDA for the 2D knapsack problem with guillotine constraint

  2018cites this paper
• Bus driver rostering by hybrid methods based on column generation

  2018cites this paper
• Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming

  2016cites this paper
• A Column Generation Based Heuristic for a Bus Driver Rostering Problem

  2015cites this paper
• Exact algorithms for the two-dimensional guillotine knapsack

  2012cites this paper
• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces

  2009cites this paper
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

  2008cites this paper
• Algoritmos para problemas de empacotamento

  2006cites this paper
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces

  2006cites this paper
• Inteligência Computacional Aplicada a Resolução do Problema do Corte Unidimensional

  2005cites this paper
• Research Project : Packing Problems in Combinatorial Optimization submitted to the Probral DAAD – CAPES Program

  year unknowncites this paper