ON A GENERALIZED SEQUENTIAL PARTIALLY COVERING PROBLEM

Nuriyeva F.

APPLIED AND COMPUTATIONAL MATHEMATICS, cilt.15, sa.2, ss.239-242, 2016 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 15 Sayı: 2
  • Basım Tarihi: 2016
  • Dergi Adı: APPLIED AND COMPUTATIONAL MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.239-242
  • Anahtar Kelimeler: Bandpass Problem, Band Collection Problem, Sequential Partially Covering Problem, Dynamic Programming, Complexity Analysis, OPTIMIZATION
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.