Generalized Bin Covering Problem in Integer Linear Programming
Publish place: کنفرانس بین المللی مهندسی کامپیوتر و فناوری اطلاعات
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 653
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CITCOMP01_226
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
In this paper, we study the GENERALIZED Bin COVERING problem. This problem is an NP-hard optimization problem, Since there is no way to find optimal solution or a solution near to optimal, This paper try using Integer Linear programming as a method to find optimal for not large instances.
Keywords:
Generalized Bin covering Problem , Integer linear Programming
Authors
Somaye Jabari
University of Tehran, Department of Algorithms and Computation
Amin Ghodousian
University of Tehran, College od Engineering, Faculty of Engineering