Buradasınız

Anasayfa » Content

İNTERNET ÜZERİNDE OPTİMAL BİLGİ AKIŞI

OPTIMAL KNOWLEDGE FLOW ON THE INTERNET

Journal Name:

  • İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi

Publication Year:

  • 2006

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
Akışve Minimum Kapsayan Ağaç problemleri Yöneylem Araştırması’nda ve Bilgisayar Bilimleri’nde karşılaşılan temel problemlerdendir. Yapılan çalışmada, maksimum akışproblemi ve minimum kapsayan ağaç probleminin bileşimi şeklinde ele alınabilecek yeni bir problem incelenmiştir. İfade edilen problemle, bilgi akışının olduğu internet ortamında karşılaşılmaktadır. Maksimum AkışProblemi ve Minimum Kapsayan Ağaç problemi için polinom zamanda çözüm veren algoritmalar bulunmasına rağmen tanımlanan problem NP-Tam sınıftandır. Problemin optimal çözümü, Global Optimizasyon problemleri’nin genişbir sınıfının çözümünde karşılaşılan “Yardımcı Altproblem” in çözümündeki denge durumuna karşı gelmektedir. Gösterilmiştir ki, Yardımcı Alt problem’in çözümü için geliştirilen algoritmalar, bu çalışmada incelenen probleme de uyarlanabilir.
Bookmark/Search this post with
Abstract (Original Language): 
The 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.
FULL TEXT (PDF): 
PDF icon arastirmax-internet-uzerinde-optimal-bilgi-akisi.pdf
  • 10
1-11
  • Turkish

REFERENCES

References: 

Andramonov, M.Y., Rubinov, A.M. and Glover, B.M., (1999), “Cutting Angle
Methods in Global Optimization”, Applied Mathematics Letters, 12, 95 - 100.
Babayev, D.A., (2000),“An Exact Method for Solving the Subproblem of the
Cutting Angle Method of Global Optimization”, In Book "Optimization and Related
Topics", In Kluwer Academic Publishers, Ser. "Applied Optimization", Dordrecht,
47, 15 – 26.
Nuriyev, U.G., (2005), “An Approach to the Subproblem of the Cutting Angle
Method of Global Optimization”, Journal of Global Optimization, 31, 2005, 353-370.
Nuriyev U.G. and Ordin B., (2004), “Computing Near-Optimal Solutions for the
Dominating Subset with Minimal Weight Problem”, International Journal of
Computer Mathematics, 81, 11.
İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi Güz 2006/2
11
Nuriyev U.G. and Ordin B., (2003), “Analysis of theComplexity of the Dominating
Subset with the Minimal Weight Problem”, EURO / INFORMS Conferences, July,
2003, Istanbul, Turkey.
Ordin B., (2004), “On the Subproblem of the CuttingAngle Method of Global
Optimization”, The Euro Summer Institute-ESI XXII Optimization and Data
Mining, July 9-25, 2004, Ankara, Turkey.
Papadimitriou, C. H., Steiglitz, K., (1982), “Combinatorial Optimization:
Algorithms and Complexity”, Prentice Hall, 496.

Thank you for copying data from http://www.arastirmax.com