Yazar "Nuriyev, Urfat" seçeneğine göre listele
Listeleniyor 1 - 1 / 1
Sayfa Başına Sonuç
Sıralama seçenekleri
Öğe Optimal knowledge flow on the internet(İstanbul Ticaret Üniversitesi, 2006) Ordin, Burak; Nuriyev, UrfatThe flow problem and the minimum spanning tree problem are both fundamental in operational research and computer science. We are concerned with a new problem which is a combination of maximum flow and minimum spanning tree problems. The applied interpretation of the expressed problem is to correspond an optimal knowledge flow on the internet. Although there are polynomial algorithms for the maximum flow problem and the minimum spanning tree problem, the defined problem is NP-Complete. It is shown that the optimal solution of the problem corresponds an equilibrium state in subproblem which is an auxiliary problem of Cutting Angle Method in solving of the Global Optimization Problems and the developed algorithms for solving of the subproblem could be used to solve the expressing problem.
