Optimal Knowledge Flow On the Internet

Burak Ordin; Urfat Nuriyev

Optimal Knowledge Flow On the Internet

Year 2006, Volume: 5 Issue: 10, 1 - 11, 01.12.2006

Burak Ordin Urfat Nuriyev

Abstract

Keywords

-

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.
Nuriyev U.G. and Ordin B., (2003), “Analysis of the Complexity of the Dominating Subset with the Minimal Weight Problem”, EURO / INFORMS Conferences, July, 2003, Istanbul, Turkey. Ordin B., (2004), “On the Subproblem of the Cutting Angle 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.

Optimal Knowledge Flow On the Internet

Year 2006, Volume: 5 Issue: 10, 1 - 11, 01.12.2006

Burak Ordin Urfat Nuriyev

Abstract

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

Keywords

Optimal Bilgi Akışı, Maksimum Akış Problemi, Minimum Kapsayan Ağaç

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.
Nuriyev U.G. and Ordin B., (2003), “Analysis of the Complexity of the Dominating Subset with the Minimal Weight Problem”, EURO / INFORMS Conferences, July, 2003, Istanbul, Turkey. Ordin B., (2004), “On the Subproblem of the Cutting Angle 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.

There are 6 citations in total.

Details

Primary Language	Turkish
Journal Section	Research Articles
Authors	Burak Ordin This is me Urfat Nuriyev This is me
Publication Date	December 1, 2006
Submission Date	August 10, 2015
Published in Issue	Year 2006 Volume: 5 Issue: 10

Cite

APA	Ordin, B., & Nuriyev, U. (2006). Optimal Knowledge Flow On the Internet. İstanbul Commerce University Journal of Science, 5(10), 1-11.
AMA	Ordin B, Nuriyev U. Optimal Knowledge Flow On the Internet. İstanbul Commerce University Journal of Science. December 2006;5(10):1-11.
Chicago	Ordin, Burak, and Urfat Nuriyev. “Optimal Knowledge Flow On the Internet”. İstanbul Commerce University Journal of Science 5, no. 10 (December 2006): 1-11.
EndNote	Ordin B, Nuriyev U (December 1, 2006) Optimal Knowledge Flow On the Internet. İstanbul Commerce University Journal of Science 5 10 1–11.
IEEE	B. Ordin and U. Nuriyev, “Optimal Knowledge Flow On the Internet”, İstanbul Commerce University Journal of Science, vol. 5, no. 10, pp. 1–11, 2006.
ISNAD	Ordin, Burak - Nuriyev, Urfat. “Optimal Knowledge Flow On the Internet”. İstanbul Commerce University Journal of Science 5/10 (December 2006), 1-11.
JAMA	Ordin B, Nuriyev U. Optimal Knowledge Flow On the Internet. İstanbul Commerce University Journal of Science. 2006;5:1–11.
MLA	Ordin, Burak and Urfat Nuriyev. “Optimal Knowledge Flow On the Internet”. İstanbul Commerce University Journal of Science, vol. 5, no. 10, 2006, pp. 1-11.
Vancouver	Ordin B, Nuriyev U. Optimal Knowledge Flow On the Internet. İstanbul Commerce University Journal of Science. 2006;5(10):1-11.