The Bin Packing problem is a well-known and highly investigated problem in the computer science: we have n items given with their sizes, and we want to assign them to unit capacity bins such, that we use the minimum number of bins
The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. Th...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
In this paper we study the bin packing problem with general precedence constraints, in which a set o...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set ...
International audienceIn the classical bin-packing problem with conflicts (BPC), the goal is to mini...
The Multi-Level Bin Packing problem and its variants are some of the most popular combinatorial opti...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
Abstract. We consider the two-dimensional bin packing problem (BPP): given a set I = {1,..., n} of r...
AbstractUsually, for bin packing problems, we try to minimize the number of bins used or in the case...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
The multibin-packing constraint captures a fundamental substructure of many assignment problems, whe...
In this study, we consider two bi-objective bin packing problems that assign a number of weighted it...
In this thesis, two bicriteria bin packing problems are addressed. Bin packing problem is an NP-hard...
International audienceThe bin packing problem with conflicts (BPC) consists of minimizing the number...
The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. Th...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
In this paper we study the bin packing problem with general precedence constraints, in which a set o...
Bin packing is an optimizational NP-hard problem of packing items of given sizes into minimum number...
The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set ...
International audienceIn the classical bin-packing problem with conflicts (BPC), the goal is to mini...
The Multi-Level Bin Packing problem and its variants are some of the most popular combinatorial opti...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
Abstract. We consider the two-dimensional bin packing problem (BPP): given a set I = {1,..., n} of r...
AbstractUsually, for bin packing problems, we try to minimize the number of bins used or in the case...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
The multibin-packing constraint captures a fundamental substructure of many assignment problems, whe...
In this study, we consider two bi-objective bin packing problems that assign a number of weighted it...
In this thesis, two bicriteria bin packing problems are addressed. Bin packing problem is an NP-hard...
International audienceThe bin packing problem with conflicts (BPC) consists of minimizing the number...
The purpose of bin packing is the effective apportionment of smaller elements in the bigger ones. Th...
INTEGER-BIN-PACKING: Given a list L of n items of integer size/weight, and a integer bin-capacity K,...
In this paper we study the bin packing problem with general precedence constraints, in which a set o...
DOI
Add to ORKG