An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Conference on Integer Programming and Combinatorial Optimization

• Publication date

  2002-05-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-47867-1_23
• 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 bounds for multi-dimensional packing

  2002cited by this paper
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

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

  2000cited by this paper
• Approximation algorithms for bin packing: a survey

  1996cited by this paper
• An LP-based approach to a two-stage cutting stock problem

  1995cited by this paper
• A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem

  1994cited by this paper
• Integer Programming with a Fixed Number of Variables

  1983cited by this paper
• Shelf Algorithms for Two-Dimensional Packing Problems

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

  1982influential reference
• An efficient approximation scheme for the one-dimensional bin-packing problem

  1982influential reference
• Bin packing can be solved within 1 + ε in linear time

  1981cited by this paper
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

  1980influential reference
• Orthogonal Packings in Two Dimensions

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

  1965cited by this paper

• Using the Branch and Bound Method to Solve the Optimal Packaging Problem

  2023cites this paper
• Approximation Algorithm for Multiple Strip Packing

  2020cites this paper
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem

  2018cites this paper
• Two-Dimensional Bin Packing Problem with Guillotine Restrictions

  2015cites this paper
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem

  2013cites this paper
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem

  2011cites this paper
• Approximation Algorithms for Multiple Strip Packing

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

  2008cites this paper
• Comments on knapsack problems with a penalty

  2007influential citation
• Enhanced Design Flow and Optimizations for Multiproject Wafers

  2007cites this paper
• Algoritmos para problemas de empacotamento

  2006cites this paper
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

  2005cites this paper
• A 3-approximation algorithm for two-dimensional bin packing

  2005cites this paper
• Algorithms for packing and scheduling problems

  2003cites this paper
• Packing 2-dimensional bins in harmony

  2002influential citation