A genetic algorithm for the minimum generating set problem

Abstract

Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinatorial number theory and is related to some real-world problems, such as planning… (More)
DOI: 10.1016/j.asoc.2016.07.020

Topics

12 Figures and Tables

Slides referencing similar topics