We present an algorithm that generates multiset permutations in O(1) time for each permutation, that is, by a loop-less algorithm with O(n) extra memory requirement. There already exist several such algorithms that generate multiset permutations in various orders. For multiset permutations, we combine two loop-less algorithms that are designed in the same principle of tree traversal. Our order ...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

In the present paper, an approach is proposed for structural topology optimization based on combination of Radial Basis Function (RBF) Level Set Method (LSM) with Isogeometric Analysis (IGA). The corresponding combined algorithm is detailed. First, in this approach, the discrete problem is formulated in Isogeometric Analysis framework. The objective function based on compliance of particular lo...