{"id":20111,"date":"2016-09-09T11:44:00","date_gmt":"2016-09-09T09:44:00","guid":{"rendered":"https:\/\/newsite.finki.ukim.mk\/events\/otvoreno-predavanje\/"},"modified":"2026-06-12T09:50:33","modified_gmt":"2026-06-12T07:50:33","slug":"otvoreno-predavanje","status":"publish","type":"event","link":"https:\/\/newsite.finki.ukim.mk\/en\/events\/otvoreno-predavanje\/","title":{"rendered":"\u041e\u0442\u0432\u043e\u0440\u0435\u043d\u043e \u043f\u0440\u0435\u0434\u0430\u0432\u0430\u045a\u0435"},"content":{"rendered":"<p>\u041d\u0430 13.09 (\u0412\u0442\u043e\u0440\u043d\u0438\u043a) \u043e\u0434 14:00 \u0432\u043e \u0411\u0430\u0440\u0430\u043a\u0430 2.1 \u043d\u0430 \u0424\u0418\u041d\u041a\u0418 \u045c\u0435 \u0441\u0435 \u043e\u0434\u0440\u0436\u0438 \u043e\u0442\u0432\u043e\u0440\u0435\u043d\u043e \u043f\u0440\u0435\u0434\u0430\u0432\u0430\u045a\u0435 \u043d\u0430 \u0442\u0435\u043c\u0430 &#8220;Efficient Algorithms for Tackling Computationally Challenging Problems&#8221; \u043e\u0434 \u0434-\u0440 \u0410\u043b\u0435\u043a\u0441\u0430\u043d\u0434\u0430\u0440 \u0428\u0443\u0440\u0431\u0435\u0432\u0441\u043a\u0438, \u0434\u043e\u0446\u0435\u043d\u0442 \u043d\u0430 \u041a\u0458\u043e\u0442\u043e \u0423\u043d\u0438\u0432\u0435\u0440\u0437\u0438\u0442\u0435\u0442\u043e\u0442 \u0432\u043e \u0408\u0430\u043f\u043e\u043d\u0438\u0458\u0430, \u043d\u0430 \u043a\u043e\u0435 \u0441\u0435 \u043f\u043e\u043a\u0430\u043d\u0435\u0442\u0438 \u0441\u0438\u0442\u0435 \u0441\u0442\u0443\u0434\u0435\u043d\u0442\u0438 \u0438 \u043a\u043e\u043b\u0435\u0433\u0438. \u0414-\u0440 \u0410\u043b\u0435\u043a\u0441\u0430\u043d\u0434\u0430\u0440 \u0428\u0443\u0440\u0431\u0435\u0432\u0441\u043a\u0438\u00a0\u0434\u043e\u0434\u0438\u043f\u043b\u043e\u043c\u0441\u043a\u0438\u0442\u0435 \u0441\u0442\u0443\u0434\u0438\u0438 \u0433\u0438 \u0438\u043c\u0430 \u0437\u0430\u0432\u0440\u0448\u0435\u043d\u043e \u043d\u0430 \u0424\u0415\u0418\u0422, \u0423\u041a\u0418\u041c, \u0421\u043a\u043e\u043f\u0458\u0435, \u0430 \u043c\u0430\u0433\u0438\u0441\u0442\u0435\u0440\u0441\u043a\u0438\u0442\u0435 \u0438 \u0434\u043e\u043a\u0442\u043e\u0440\u0441\u043a\u0438\u0442\u0435 \u0441\u0442\u0443\u0434\u0438\u0438 \u0433\u0438 \u0437\u0430\u0432\u0440\u0448\u0443\u0432\u0430 \u043d\u0430 \u041a\u0458\u043e\u0442\u043e \u0423\u043d\u0438\u0432\u0435\u0440\u0437\u0438\u0442\u0435\u0442\u043e\u0442 \u0432\u043e \u0408\u0430\u043f\u043e\u043d\u0438\u0458\u0430, \u043a\u0430\u0434\u0435 \u043e\u0441\u0442\u0430\u043d\u0443\u0432\u0430 \u0434\u0430 \u0440\u0430\u0431\u043e\u0442\u0438 \u0438 \u043f\u043e\u0441\u043b\u0435 \u0437\u0430\u0432\u0440\u0448\u0443\u0432\u0430\u045a\u0435\u0442\u043e \u043d\u0430 \u0441\u0442\u0443\u0434\u0438\u0438\u0442\u0435.<\/p>\n<p>\u041a\u0440\u0430\u0442\u043e\u043a \u0430\u043f\u0441\u0442\u0440\u0430\u043a\u0442 \u043e\u0434 \u043f\u0440\u0435\u0434\u0430\u0432\u0430\u045a\u0435\u0442\u043e:<br \/>\n&#8220;A wealth of real-world problems arising from engineering, industry and\u00a0society can be modeled mathematically using discrete structures. Then, we could use the framework of combinatorial optimization to tackle\u00a0them, i.e., obtain a solution and apply it to the original problem. Unfortunately, most of the problems worth solving are labeled computationally intractable,\u201d and our present knowledge states that\u00a0it is highly unlikely to devise efficient algorithms which solve them<br \/>\nexactly. With this hindsight, efforts have been focused on developing\u00a0exact algorithms that are tailored for special types of instances, or approximation algorithms, which run efficiently, and provide a solution whose cost is within guaranteed bounds of an exact optimal solution. We will overview some of the recent progress and results on these topics, and their applicability to the real-world problems which initially inspired them.&#8221;<\/p>","protected":false},"featured_media":20112,"template":"","tags":[],"class_list":["post-20111","event","type-event","status-publish","has-post-thumbnail","hentry"],"_links":{"self":[{"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/event\/20111","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/event"}],"about":[{"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/types\/event"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/media\/20112"}],"wp:attachment":[{"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/media?parent=20111"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/newsite.finki.ukim.mk\/en\/wp-json\/wp\/v2\/tags?post=20111"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}