New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Computers & Operations Research

• Publication date

  2007-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2005.08.012
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computing redundant resources for the resource constrained project scheduling problem

  2007cited by this paper
• Bidimensional packing by bilinear programming

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

  2005cited by this paper
• Fast lifting procedures for the bin packing problem

  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 two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case

  2003cited by this paper
• The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

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

  2001cited by this paper
• A new LP-based lower bound for the cumulative scheduling problem

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

  1998cited by this paper
• Capacitated Vehicle Routing on Trees

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

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

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

  1987cited 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
• Orthogonal Packings in Two Dimensions

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

  1973cited by this paper

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

  2025cites this paper
• An exact approach for the two-dimensional strip packing problem with defects

  2025cites this paper
• Mixed-Integer and Constraint Programming Models for the Two-Dimensional Guillotine Cutting Problem

  2025cites this paper
• One-dimensional bin packing with pattern-dependent processing time

  2024cites this paper
• A new branch-and-cut approach for integrated planning in additive manufacturing

  2023cites this paper
• A combinatorial flow-based formulation for temporal bin packing problems

  2022cites this paper
• Pareto-like sequential sampling heuristic for global optimisation

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

  2021cites this paper
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

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

  2020influential citation
• Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect

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

  2019influential citation
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems

  2019cites this paper
• The multiple vehicle balancing problem

  2018cites this paper
• Applying triple-block patterns in solving the two-dimensional bin packing problem

  2018influential citation
• Two-Dimensional Bin Packing

  2018cites this paper
• One-Dimensional Bin Packing

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

  2018influential citation
• New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks

  2017cites this paper
• Maximum lateness minimization in one-dimensional bin packing

  2017influential citation
• Bee Colony Optimization Applied to the Bin Packing Problem

  2017cites this paper
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems

  2017cites this paper
• Exact Solution of Combined Cutting Stock and Scheduling Problems

  2016cites this paper
• Determining the best shipper sizes for sending products to customers

  2016cites this paper
• New Pretreatment and Resolution using the Bee Colony Optimization for the Two-Dimensional Bin Packing Problem

  2016cites this paper
• General Dual-Feasible Functions

  2016cites this paper
• Other Applications in General Integer Programming

  2016cites this paper
• Classical Dual-Feasible Functions

  2016cites this paper
• Applications for Cutting and Packing Problems

  2016cites this paper
• Linear and Integer Programming

  2016cites this paper
• Constructing general dual-feasible functions

  2015cites this paper
• Preprocessing and an improved MIP model for examination timetabling

  2015cites this paper
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity

  2015influential citation
• A hybrid algorithm for constrained order packing

  2014influential citation
• Two‐Dimensional Bin Packing Problems

  2014cites this paper
• A Reduction Algorithm for Packing Problems

  2014cites this paper
• A preemptive bound for the Resource Constrained Project Scheduling Problem

  2014cites this paper
• Relations between capacity utilization, minimal bin size and bin number

  2014cites this paper
• Upper bounds for heuristic approaches to the strip packing problem

  2014cites this paper
• Relations between capacity utilization, minimal bin size and bin number

  2014cites this paper
• High-Multiplicity Scheduling and Packing Problems

  2014influential citation
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem

  2014cites this paper
• High-multiplicity Scheduling and Packing Problems : Theory and Applications

  2014influential citation
• Thesis submitted for the degree of Doctor Université de Technologie de Compiègne

  2014cites 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
• A New Graph-Theoretical Model for the Guillotine-Cutting Problem

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

  2013cites this paper
• A preemptive bound for the Resource Constrained Project Scheduling Problem

  2013cites this paper
• Lower bounds for three-dimensional multiple-bin-size bin packing problems

  2013cites this paper
• New Lower Bounds for the Three-Dimensional Strip Packing Problem

  2013cites this paper
• Improved bounds for hybrid flow shop scheduling with multiprocessor tasks

  2013cites this paper
• New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem

  2013cites this paper
• 5. Two-Dimensional Bin Packing Problems

  2013cites this paper
• A note on ” Relations between capacity utilization and minimal bin number“

  2012cites this paper
• MPQ-trees for the Orthogonal Packing Problem

  2012cites this paper
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

  2012cites this paper
• Algorithms for optimizing shared mobility systems

  2012cites this paper
• Worst-case analysis of maximal dual feasible functions

  2012cites this paper
• A constraint programming approach for a batch processing problem with non-identical job sizes

  2012cites this paper
• LP bounds in various constraint programming approaches for orthogonal packing

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

  2011cites this paper
• Computing maximal dual-feasible functions using a novel approach

  2011cites this paper
• ECOLE DOCTORALE SCIENCES ET TECHNOLOGIES DE L'INFORMATION ET MATHÉMATIQUES

  2011cites this paper
• Worst-case analysis of maximal dual feasible functions

  2011influential citation
• A skyline heuristic for the 2D rectangular packing and strip packing problems

  2011cites this paper
• General properties of staircase and convex dual feasible functions

  2011influential citation
• Conservative scales in packing problems

  2011influential citation
• New Stabilization Procedures for the Cutting Stock Problem

  2011cites this paper
• Theoretical investigations on maximal dual feasible functions

  2010cites this paper
• MPQ-trees for orthogonal packing problem

  2010cites this paper
• A survey of dual-feasible and superadditive functions

  2010influential citation
• Algorithmes pour des problèmes de bin packing mono- et multi-objectif

  2010influential citation
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

  2010cites this paper
• A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem

  2010influential citation
• New lower bounds for bin packing problems with conflicts

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

  2010cites this paper
• LP-Based Heuristics for Conservative Scales in Orthogonal Packing

  2009cites this paper
• A branch and bound algorithm for the strip packing problem

  2009influential citation
• 2D Multi-Objective Placement Algorithm for Free-Form Components

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

  2009influential citation
• One-dimensional relaxations and LP bounds for orthogonal packing

  2009cites this paper
• Lower-dimensional Relaxations of Higher-dimensional Orthogonal Packing

  2008cites this paper
• A new constraint programming approach for the orthogonal packing problem

  2008influential citation
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

  2008cites this paper
• A new lower bound for the non-oriented two-dimensional bin-packing problem

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

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

  2007cites this paper
• Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures. (The two-dimensional bin-packing problem, the non-oriented case: resolution algorithms and lower bounds)

  2006influential citation
• Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures.

  2006influential citation
• A TABU SEARCH METHOD FOR THE NON-ORIENTED TWO-DIMENSIONAL BIN-PACKING PROBLEM

  2006cites this paper