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

DOI10.1093/comjnl/31.1.65zbMath0647.68070OpenAlexW2073441554MaRDI QIDQ3792258

Masahiro Miyakawa, Ivan Stojmenović

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

zbMATH Keywords

knapsackminimal coveringlexicographic enumerationbase enumerationsubset-generating algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Classification of \(P_{k2}\) ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. ⋮ Classification of three-valued logical functions preserving 0 ⋮ Generating subsets on a systolic array ⋮ A parallel algorithm for generating combinations

This page was built for publication: Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems