New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Canadian Conference on Computational Geometry

• Publication date

  2013-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2012.10.024
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximation Algorithms

  2021cited by this paper
• Dismantlable Digraphs and the Fixed Point Property Rueiher Tsaur

  2012cited by this paper
• Efficient lower bounds and heuristics for the variable cost and size bin packing problem

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

  2010cited by this paper
• Theoretical investigations on maximal dual feasible functions

  2010cited by this paper
• New lower bounds for bin packing problems with conflicts

  2010cited by this paper
• A new destructive bounding scheme for the bin packing problem

  2010cited by this paper
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

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

  2007cited by this paper
• Computing the asymptotic worst-case of bin packing lower bounds

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

  2007cited by this paper
• A new lower bound for the non-oriented two-dimensional bin-packing problem

  2007cited by this paper
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

  2007cited by this paper
• An analysis of lower bound procedures for the bin packing problem

  2005cited by this paper
• Bidimensional packing by bilinear programming

  2005cited by this paper
• New lower bounds for the three-dimensional finite bin packing problem

  2004cited by this paper
• A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

  2004cited by this paper
• The book review column

  2003cited by this paper
• New Bounds for Multidimensional Packing

  2003cited by this paper
• A lower bound for the non-oriented 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
• The Three-Dimensional Bin Packing Problem

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

  1998cited by this paper
• Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

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

  1996cited by this paper
• Capacitated Vehicle Routing on Trees

  1991cited by this paper
• Lower bounds and reduction procedures for the bin packing problem

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

  1990cited by this paper
• Bin packing with items uniformly distributed over intervals [a,b]

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• An efficient approximation scheme for the one-dimensional bin-packing problem

  1982cited by this paper
• Bin packing can be solved within 1 + ε in linear time

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

  1973cited by this paper

• A multistart biased-randomized algorithm for solving a three-dimensional case picking problem with real-life constraints

  2023cites this paper
• Sequential heuristic for the two-dimensional bin-packing problem

  2015cites this paper
• A Hybrid Heuristic Algorithm for Ship Block Construction Space Scheduling Problem

  2015cites this paper
• The two-dimensional vector packing problem with piecewise linear cost function $

  2015cites this paper
• Constraints in container loading - A state-of-the-art review

  2013cites this paper
• New lower bounds for bin packing problems with conflicts

  2010cites this paper