Keyword: bin packing

Found 66 papers in total
A hybrid algorithm for constrained order packing
A hybrid algorithm for constrained order packing
2014,
Constraint order packing, which is an extension to the classical...
A note on a selfish bin packing problem
A note on a selfish bin packing problem
2013,
In this paper, we consider a selfish bin packing problem, where each item is a selfish...
On‐line bin packing with restricted repacking
On‐line bin packing with restricted repacking
2014,
Semi‐on‐line algorithms for the bin‐packing problem allow, in...
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
2013,
In this paper, we study 1‐space bounded multi‐dimensional bin packing...
Bin Packing with Conflicts: A Generic Branch‐and‐Price Algorithm
Bin Packing with Conflicts: A Generic Branch‐and‐Price Algorithm
2013,
The bin packing problem with conflicts consists of packing items in a minimum number...
New lower bounds for the three‐dimensional orthogonal bin packing problem
New lower bounds for the three‐dimensional orthogonal bin packing problem
2013,
In this paper, we consider the three‐dimensional orthogonal bin packing...
Absolute approximation ratios for packing rectangles into bins
Absolute approximation ratios for packing rectangles into bins
2012,
We consider the problem of packing rectangles into bins that are unit squares, where...
Comparing online algorithms for bin packing problems
Comparing online algorithms for bin packing problems
2012,
The relative worst‐order ratio is a measure of the quality of online...
New Bounds for Multidimensional Packing
New Bounds for Multidimensional Packing
2003,
New upper and lower bounds are presented for a multidimensional generalization of bin...
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
2012,
We continue the study of bin packing with splittable items and cardinality...
MPQ‐trees for the Orthogonal Packing Problem
MPQ‐trees for the Orthogonal Packing Problem
2012,
Given a set of rectangular items of different sizes and a rectangular container, the...
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
2011,
In the cutting stock problem, we are given a set of objects of different types, and...
Algorithms for the bin packing problem with conflicts
Algorithms for the bin packing problem with conflicts
2010,
We consider a particular bin packing problem in which some pairs of items may be in...
A note on online hypercube packing
A note on online hypercube packing
2010,
In this paper, we study an online multi-dimensional bin packing problem where all...
An exact algorithm for the type-constrained and variable sized bin packing problem
An exact algorithm for the type-constrained and variable sized bin packing problem
2009,
In this paper, we introduce an additional constraint to the one-dimensional variable...
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
2008,
One of the main issues in addressing three–dimensional packing problems is...
Packing d-Dimensional Bins in d Stages
Packing d-Dimensional Bins in d Stages
2008,
We consider the d –dimensional bin–packing problem, the most relevant...
Online bin packing with resource augmentation
Online bin packing with resource augmentation
2007,
In competitive analysis, we usually do not put any restrictions on the computational...
A new exact method for the two-dimensional bin-packing problem with fixed orientation
A new exact method for the two-dimensional bin-packing problem with fixed orientation
2007,
We propose a new exact method for the well-known two-dimensional bin-packing problem....
A new lower bound for the non-oriented two-dimensional bin-packing problem
A new lower bound for the non-oriented two-dimensional bin-packing problem
2007,
We propose a new scheme for computing lower bounds for the non-oriented bin-packing...
Hybrid procedure to determine optimal workforce without noise hazard exposure
Hybrid procedure to determine optimal workforce without noise hazard exposure
2006,
Hearing loss is a major occupational health problem among industrial workers....
On-line bin packing with two item sizes
On-line bin packing with two item sizes
2006,
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of...
A class of on-line bin packing problems with multiple kernels
A class of on-line bin packing problems with multiple kernels
2005,
We consider a new class of on-line variable-sized bin packing problems as follows:...
Resource augmentation in two-dimensional packing with orthogonal rotations
Resource augmentation in two-dimensional packing with orthogonal rotations
2006,
We consider the problem of packing two-dimensional rectangles into the minimum number...
Papers per page: