Skip Navigation

The Computer Journal 1988 31(1):65-70; doi:10.1093/comjnl/31.1.65
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Stojmenovic, I.
Right arrow Articles by Miyakawa, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems

I. Stojmenovic1 * and M. Miyakawa2 §

1 Institute of Mathematics, University of Novi Sad, dr Ilije Djuricica 4, 21000 Novi Sad, Yugoslavia, 2 Electrotechnical Laboratory, 1-1-4 Umezono, Sakura-mura, Niihari-gun, Ibaraki 305, Japan

On the basis of a backtrack procedure for lexicographic enumeration of all subsets of a set of n elements, we give an algorithm both for determining all bases consisting of functions from a given complete set in a considered subset of the set of k-valued logical functions, and for enumeration of all classes of bases in the subset. We use the lexicographic algorithm also for solving knapsack and minimal covering problems. A cut technique is described which is used in these algorithms to reduce the number of examined subsets of {1, ..., n}.

Received May 1986.

* Institute of Mathematics, University of Novi Sad, dr Ilije Djuricica 4, 21000 Novi Sad, Yugoslavia

§ Electrotechnical Laboratory, 1-1-4 Umezono, Sakura-mura, Niihari-gun, Ibaraki 305, Japan


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.