The two-dimensional finite bin packing problem. II: New lower and upper bounds

DOI10.1007/S10288-002-0006-YzbMATH Open1097.90033OpenAlexW2029484438MaRDI QIDQ1432017FDOQ1432017

Authors: Aristide Mingozzi, Marco A. Boschetti 

Publication date: 11 June 2004

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-002-0006-y

Recommendations

• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• A computational study of lower bounds for the two dimensional bin packing problem
• New approximability results for two-dimensional bin packing
• New approximability results for two-dimensional bin packing
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• New approximability and inapproximability results for 2-dimensional bin packing
• A lower bound for the non-oriented two-dimensional bin packing problem
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• Two-bounded-space bin packing revisited
• Two-Dimensional Finite Bin-Packing Algorithms

zbMATH Keywords

lower boundscutting and packingheuristic algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (31)

• Exact solution techniques for two-dimensional cutting and packing
• An introduction to the two‐dimensional rectangular cutting and packing problem
• Routing problems with loading constraints
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• An investigation into two bin packing problems with ordering and orientation implications
• A computational study of lower bounds for the two dimensional bin packing problem
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• A hybrid algorithm for constrained order packing
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• A survey of dual-feasible and superadditive functions
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• The off-line group seat reservation problem
• Models for two-dimensional bin packing problems with customer order spread
• Algorithms for nesting with defects
• A new destructive bounding scheme for the bin packing problem
• A lower bound for the non-oriented two-dimensional bin packing problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• A new exact method for the two-dimensional bin-packing problem with fixed orientation
• Bidimensional packing by bilinear programming
• Space defragmentation for packing problems
• The three-dimensional knapsack problem with balancing constraints
• New Approximability Results for 2-Dimensional Packing Problems
• The two-dimensional bin packing problem with variable bin sizes and costs
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• Deterministic model for customized pilot manufacture production with various backplane sizes
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• A new exact method for the two-dimensional orthogonal packing problem
• Sequential heuristic for the two-dimensional bin-packing problem

This page was built for publication: The two-dimensional finite bin packing problem. II: New lower and upper bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1432017)