Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14590
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stojmenović, I. | en_US |
dc.contributor.author | Miyakawa, M. | en_US |
dc.date.accessioned | 2020-03-03T14:56:40Z | - |
dc.date.available | 2020-03-03T14:56:40Z | - |
dc.date.issued | 1988-01-01 | - |
dc.identifier.issn | 00104620 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/14590 | - |
dc.description.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 . | en |
dc.relation.ispartof | Computer Journal | en |
dc.title | Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1093/comjnl/31.1.65 | - |
dc.identifier.scopus | 2-s2.0-0023961209 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0023961209 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 70 | en |
dc.relation.firstpage | 65 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 31 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | Naučne i umetničke publikacije |
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.