A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Inclusion tree layout convention: an empirical investigation
APVis '03 Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24
New lower bounds for the three-dimensional finite bin packing problem
Discrete Applied Mathematics
A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
ACM Transactions on Mathematical Software (TOMS)
Computers and Operations Research
Two- and three-dimensional parametric packing
Computers and Operations Research
INFORMS Journal on Computing
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
INFORMS Journal on Computing
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
Computers and Operations Research
Optimization Methods & Software
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
Local search of orthogonal packings using the lower bounds
Automation and Remote Control
An agent-based approach to knapsack optimization problems
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Computers and Operations Research
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Automation and Remote Control
Computers and Operations Research
New three-level resource management enhancing quality of offline hardware task placement on FPGA
International Journal of Reconfigurable Computing
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Computers and Operations Research
A skyline-based heuristic for the 2D rectangular strip packing problem
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Bidimensional packing by bilinear programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
WSEAS Transactions on Information Science and Applications
DC programming and DCA for large-scale two-dimensional packing problems
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Space defragmentation heuristic for 2D and 3D bin packing problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
A new exact method for the two-dimensional bin-packing problem with fixed orientation
Operations Research Letters
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters
Packing into the smallest square: Worst-case analysis of lower bounds
Discrete Optimization
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
On the two-dimensional Knapsack Problem
Operations Research Letters
Computers and Operations Research
A simple randomized algorithm for two-dimensional strip packing
Computers and Operations Research
Mixed pallet stacking: an overview and summary of the 2010 PerMIS special session
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
Optimal rectangle packing: an absolute placement approach
Journal of Artificial Intelligence Research
Computers and Operations Research
Algorithms for nesting with defects
Discrete Applied Mathematics
| Hi-index | 0.01 |
Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock pieces that provide all the pieces. The problem is NP-hard in the strong sense and finds many practical applications in the cutting and packing area. We analyze a well-known lower bound and determine its worst-case performance. We propose not lower bounds which are used within a branch-and-bound algorithm for the exact solution of the problem. Extensive computational testing on problem instances from the literature involving up to 120 pieces shows the effectiveness of the proposed approach.