Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14590
Title: | Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems | Authors: | Stojmenović, I. Miyakawa, M. |
Issue Date: | 1-Jan-1988 | Journal: | Computer Journal | Abstract: | On the basis of a backtrack procedure for lexicographic enumeration of all subsets of a set of n elements, we give an algorithm for both 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 left brace 1,. . . , n right brace . | URI: | https://open.uns.ac.rs/handle/123456789/14590 | ISSN: | 00104620 | DOI: | 10.1093/comjnl/31.1.65 |
Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
SCOPUSTM
Citations
13
checked on Nov 20, 2023
Page view(s)
12
Last Week
9
9
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.