Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
DOI10.1093/COMJNL/31.1.65zbMATH Open0647.68070OpenAlexW2073441554MaRDI QIDQ3792258FDOQ3792258
Authors: Ivan Stojmenović, Masahiro Miyakawa 
Publication date: 1988
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/31.1.65
Recommendations
- Generating functions in the knapsack problem
- Sums of lexicographically ordered sets
- An algorithm for generating subsets of fixed size with a strong minimal change property
- scientific article; zbMATH DE number 559036
- An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems
Combinatorial optimization (90C27) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (8)
- An optimal algorithm for generating equivalence relations on a linear array of processors
- Limiting the search in brute force method for subsets detection
- A Generic Program for Minimal Subsets with Applications
- A parallel algorithm for generating combinations
- Classification of three-valued logical functions preserving 0
- Classification of \(P_{k2}\)
- Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.
- Generating subsets on a systolic array
This page was built for publication: Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792258)
