نتایج جستجو برای: exact algorithm

تعداد نتایج: 851573  

Journal: :Math. Program. 1977
Giorgio Gallo Aydin Ülkücü

The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution. The Bilinear Programming Problem, in its general form, is to determin...

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.

Journal: :IEICE Transactions on Information and Systems 2017

Journal: :مدیریت صنعتی 0
حسین صفری دانشیار، مدیریت صنعتی، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران علیرضا فقیه دانشجوی دکتری مدیریت گرایش تحقیق در عملیات، دانشکدۀ مدیریت، دانشگاه تهران، تهران، ایران

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

Journal: :Theoretical Computer Science 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید