Separable subgroups have bounded packing

In this note, we prove that separable subgroups have bounded packing in ambient groups. The notion bounded packing was introduced by Hruska and Wise and in particular, our result answers positively a question of theirs, asking whether each subgroup of a virtually polycyclic group has the bounded packing property.Comment: 2 pages, to appear Proc. Amer. Math. So

A Weight-coded Evolutionary Algorithm for the Multidimensional Knapsack Problem

A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm proposed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.Comment: Submitted to Applied Mathematics and Computation on April 8, 201