APPLIED AND COMPUTATIONAL MATHEMATICS, vol.15, no.2, pp.239-242, 2016 (SCI-Expanded)
Article / Article
APPLIED AND COMPUTATIONAL MATHEMATICS
Science Citation Index Expanded (SCI-EXPANDED), Scopus
Bandpass Problem, Band Collection Problem, Sequential Partially Covering Problem, Dynamic Programming, Complexity Analysis, OPTIMIZATION
Dokuz Eylül University Affiliated:
In this study, a generalization of the Sequential Partially Covering problem is presented. An algorithm based on dynamic programming is proposed. Complexity analysis of the proposed algorithm is also discussed. This problem could have many applications such as job sharing in different workplaces, promotion campaigns of companies and etc.