A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem

No abstract is available for this paper.

• Publication year

  2018

• Venue

  RAIRO Oper. Res.

• Publication date

  2018-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1051/ro/2017019
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sequential heuristic for the two-dimensional bin-packing problem

  2015cited by this paper
• Models and algorithms for packing rectangles into the smallest square

  2015cited by this paper
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints

  2015cited by this paper
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

  2014cited by this paper
• A block-based layer building approach for the 2D guillotine strip packing problem

  2014cited by this paper
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem

  2014cited by this paper
• Combinatorial Benders' Cuts for the Strip Packing Problem

  2014cited by this paper
• A survey of dual-feasible and superadditive functions

  2010influential reference
• An approximation scheme for the two-stage, two-dimensional knapsack problem

  2010cited by this paper
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

  2010cited by this paper
• Routing problems with loading constraints

  2010cited by this paper
• Exact algorithms for the two-dimensional strip packing problem with and without rotations

  2009cited by this paper
• Heuristic approaches for the two- and three-dimensional knapsack packing problem

  2009cited by this paper
• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces

  2009cited by this paper
• Ant colony optimization for the two-dimensional loading vehicle routing problem

  2009cited by this paper
• A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints

  2009cited by this paper
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

  2008cited by this paper
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

  2008cited by this paper
• Computing redundant resources for the resource constrained project scheduling problem

  2007cited by this paper
• A new exact method for the two-dimensional bin-packing problem with fixed orientation

  2007cited by this paper
• A new exact method for the two-dimensional orthogonal packing problem

  2007cited by this paper
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

  2007influential reference
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

  2007cited by this paper
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing

  2006cited by this paper
• Bidimensional packing by bilinear programming

  2005influential reference
• New lower bounds for the three-dimensional finite bin packing problem

  2004influential reference
• A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

  2004cited by this paper
• An Exact Approach to the Strip-Packing Problem

  2003cited by this paper
• The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case

  2003influential reference
• Recent advances on two-dimensional bin packing problems

  2002cited by this paper
• An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

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

  2002cited by this paper
• New classes of fast lower bounds for bin packing problems

  2001cited by this paper
• Exact Solution of the Two-Dimensional Finite Bon Packing Problem

  1998cited by this paper
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems

  1995cited by this paper
• Optimal Scheduling of Tasks on Identical Parallel Processors

  1995cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• Two-Dimensional Finite Bin-Packing Algorithms

  1987cited by this paper
• Near-optimal bin packing algorithms

  1973cited by this paper

• An Exact Method for Storage Space Assignment at Airport Cargo Terminal: A Temporal-spatial Packing Problem

  2026cites this paper
• An Exact Algorithm for Placement Optimization in Circuit Design

  2025cites this paper
• Neural architecture search based on packed samples for identifying animals in camera trap images

  2023cites this paper
• A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function

  2023cites this paper
• Lower and upper bounding procedures for the bin packing problem with concave loading cost

  2023cites this paper
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem

  2021cites this paper
• Selective Breeding Model for Optimizing Multi Container Loading Problems with Practical Constraints

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

  2020cites this paper
• A branch-and-price algorithm for the temporal bin packing problem

  2019cites this paper
• A Hybrid PSO-LS approach for solving the Two-Dimensional Bin Packing Problem with weight capacities constraint: A case study

  2019cites this paper
• A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem

  2019cites this paper