The three-dimensional rectangular Multiple Bin Size Bin Packing Problem with transportation constraints A case study in the field of air transportation

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

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

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

The existence of the state trajectories and the invariance of the set of physically feasible state values under the dynamics of the reactor as well as the convergence of the

A constructing solution process alternating exploration mode and exploitation mode with. • more diversification at the beginning of the solution process, and more intensification at

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

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

At the same time, the regularization procedure and the amplitude correction are not needed for the case of strong field ioniza- tion since 共i兲 the electron is born away from the