Affiliation:
1. Department of Computer Science, VNU University of Science, 334 - Nguyen Trai, Hanoi, Vietnam
Abstract
In this paper we extend some well-known notions of combinatorics on multi-sets such as iterative permutation, multi-subset, iterative combination and then construct new efficient algorithms for generating all iterative permutations, multi-subsets and iterative combinations of a multi-set. Applying the parallelizing method based on output decomposition we parallelize the algorithms. Furthermore, we use these algorithms to solve an optimal problem of work arrangement and an extended knapsack one.
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Software
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献