In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be easily formulated as MGAPs; however, the large number of variables in the related 01 integer program makes it hard to find optimal solutions to these problems, even when using powerful commercial optimization packages. T...

We propose an optimization algorithm, called the small-world algorithm (SWA), based on searching mechanisms in social networks. The SWA emphasizes local rather than global search to find the solutions for optimization problems. We investigate two encoding strategies, binary encoding and decimal encoding, in the SWA and test them by function optimization and 01 multidimensional knapsack problems...

After the seminal books by Martello and Toth (1990) Kellerer, Pferschy, Pisinger (2004), knapsack problems became a classical rich research area in combinatorial optimization. The purpose of this survey, which is structured two parts, to cover developments that appeared field after publication latter volume. Part I devoted whose goal optimally assign items single knapsack. Besides (binary, subs...