Set covering location problem and p-median problem model in determining the optimal temporary waste disposal sites location in Seberang Ulu I sub-district Palembang

[1]  Seyed Taghi Akhavan Niaki,et al.  The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach , 2021 .

[2]  Darsih Idayani,et al.  Penggunaan Model Set Covering Problem dalam Penentuan Lokasi dan Jumlah Pos Pemadam Kebakaran , 2020, Jurnal Ilmiah Soulmath : Jurnal Edukasi Pendidikan Matematika.

[3]  S. Octarina,et al.  Set Covering Model in Solving Multiple Cutting Stock Problem , 2020 .

[4]  F M Puspita,et al.  The greedy randomized adaptive search procedure method in formulating set covering model on cutting stock problem , 2020, Journal of Physics: Conference Series.

[5]  Syafrial Fachri Pane,et al.  IMPLEMENTASI ALGORITMA GENETIKA UNTUK OPTIMALISASI PELAYANAN KEPENDUDUKAN , 2019, Jurnal Tekno Insentif.

[6]  Robinson Sitepu,et al.  Set covering models in optimizing the emergency unit location of health facility in Palembang , 2019, Journal of Physics: Conference Series.

[7]  Widyastuti,et al.  PERANCANGAN STRATEGI PENINGKATAN KUALITAS PELAYANAN DENGAN METODE SERVQUAL DI TOSERBA MANDIRI DEMANGSARI , 2018 .

[8]  J. Bagherinejad,et al.  Dynamic capacitated maximal covering location problem by considering dynamic capacity , 2018 .

[9]  Halim Agung,et al.  Implementasi Algoritma Genetika untuk Memprediksi Waktu dan Biaya Pengerjaan Proyek Konstruksi , 2017 .

[10]  Mohamed Elhoseny,et al.  Genetic Algorithm Based Model For Optimizing Bank Lending Decisions , 2017, Expert Syst. Appl..

[11]  Amir Ahmadi-Javid,et al.  A survey of healthcare facility location , 2017, Comput. Oper. Res..

[12]  Margaret M. Wiecek,et al.  An algorithm for approximating the Pareto set of the multiobjective set covering problem , 2017, Ann. Oper. Res..

[13]  Bojan Jovanovic,et al.  Application of set covering location problem for organizing the public postal network , 2016 .