ON A GENERALIZED SEQUENTIAL PARTIALLY COVERING PROBLEM

Nuriyeva F.

APPLIED AND COMPUTATIONAL MATHEMATICS, vol.15, no.2, pp.239-242, 2016 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 15 Issue: 2
  • Publication Date: 2016
  • Journal Name: APPLIED AND COMPUTATIONAL MATHEMATICS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.239-242
  • Keywords: Bandpass Problem, Band Collection Problem, Sequential Partially Covering Problem, Dynamic Programming, Complexity Analysis, OPTIMIZATION
  • Dokuz Eylül University Affiliated: Yes

Abstract

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.