A best fit decreasing algorithm for the three dimensional bin packing problem

The results showed that all formulations were unable to solve any instance in the data-sets FalkT (60,1000) , FalkT (120,1000) , FalkU (250,150) and Scho3 (200,100000) within the

From these results, we can see that both formulations ILP-1+Ck for k in { 1, 2 } generally have a similar performance, in particular they perform better than the formulation ILP-1,

We denote by Bin(S) a function that computes in O(n) the number of bins used by a sequence S and the sum of jobs processing time and of jobs consumption in the last bin

The experimental results were later presented by showing the influence of the number of containers in a chromosome and the influence of the number of

Title (EN) : preliminary study on the coupling learning and reasoning for image recognition to enrich the records of in the Joconde database.. Abstract (EN): The MonaLIA 1.0

Computational results on a large testbed of instances from the literature suggest that solving a lexicographic pricer is indeed advantageous, and that the adoption of the weight

In order to incorporate interests evolution in social profiling process and to take into account both relationships and information dynamics, we have proposed a

A solution of the problem consists in assigning each item i to a bin and defining its position, denoted by ( x i , y i ) which corresponds to the coordinates of its bottom