A lower bound for the non-oriented two-dimensional bin packing problem

DOI10.1016/S0166-218X(01)00253-0MaRDI QIDQ1348248zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Dell'Amico, Silvano Martello, Daniele Vigo

Publication date 15 May 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(01)00253-0, http://hdl.handle.net/11380/15977

zbMATH Keywords

branch-and-boundcutting and packinglower bound

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• A computational study of lower bounds for the two dimensional bin packing problem
• Approximation algorithm for the oriented two-dimensional bin packing problem

Cites work

• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• Exact solution of the two-dimensional finite bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• scientific article; zbMATH DE number 1131473 (Why is no real title available?)
• Packing problems
• The Three-Dimensional Bin Packing Problem

Cited in

(26)

• An agent-based approach to the two-dimensional guillotine bin packing problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
• Approximation algorithm for the oriented two-dimensional bin packing problem
• Deterministic model for customized pilot manufacture production with various backplane sizes
• 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
• The two-dimensional bin packing problem with variable bin sizes and costs
• Sequential heuristic for the two-dimensional bin-packing problem
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing
• A computational study of lower bounds for the two dimensional bin packing problem
• Prospective network flow models and algorithms for bin packing problems
• A heuristic for solving large bin packing problems in two and three dimensions
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• A hybrid algorithm for constrained order packing
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Models and algorithms for packing rectangles into the smallest square
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Recent advances on two-dimensional bin packing problems
• A new branch-and-cut approach for integrated planning in additive manufacturing
• Packing into the smallest square: worst-case analysis of lower bounds
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Two-dimensional online bin packing with rotation

This page was built for publication: A lower bound for the non-oriented two-dimensional bin packing problem

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