سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات158
تعداد شماره‌ها6,230
تعداد مقالات67,764
تعداد مشاهده مقاله115,192,285
تعداد دریافت فایل اصل مقاله89,940,379
Jabari, S., Moazzami, Dara, Ghodousian, A.. (1394). Heuristic and exact algorithms for Generalized Bin Covering Problem. , 47(1), 53-62. doi: 10.22059/jac.2016.7936
S. Jabari; Dara Moazzami; A. Ghodousian. "Heuristic and exact algorithms for Generalized Bin Covering Problem". , 47, 1, 1394, 53-62. doi: 10.22059/jac.2016.7936
Jabari, S., Moazzami, Dara, Ghodousian, A.. (1394). 'Heuristic and exact algorithms for Generalized Bin Covering Problem', , 47(1), pp. 53-62. doi: 10.22059/jac.2016.7936
Jabari, S., Moazzami, Dara, Ghodousian, A.. Heuristic and exact algorithms for Generalized Bin Covering Problem. , 1394; 47(1): 53-62. doi: 10.22059/jac.2016.7936

Heuristic and exact algorithms for Generalized Bin Covering Problem

Journal of Algorithms and Computation
مقاله 6، دوره 47، شماره 1، شهریور 2016، صفحه 53-62    اصل مقاله (266.76 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2016.7936
نویسندگان
S. Jabari* 1؛ Dara Moazzami2؛ A. Ghodousian2
1University of Tehran, Department of Algorithms and Computation.
2University of Tehran, College of Engineering, Faculty of Engineering Science
چکیده
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
کلیدواژه‌ها
Generalized Bin Covering Problem؛ heuristic algorithm؛ greedy algorithm
آمار
تعداد مشاهده مقاله: 1,336
تعداد دریافت فایل اصل مقاله: 1,048


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب