INTERNACIONALNI UNIVERZITET TRAVNIK U TRAVNIKU
EKONOMSKI FAKULTET TRAVNIK U TRAVNIKU
PRAVNI FAKULTET TRAVNIK U TRAVNIKU
FAKULTET ZA MEDIJE I KOMUNIKACIJE TRAVNIK U TRAVNIKU
u saradnji sa
MIT UNIVERZITET SKOPLJE, SJEVERNA MAKEDONIJA
VEVU, VELEUČILIŠTE LAVOSLAV RUZIČKA U VUKOVARU, HRVATSKA
VELEUČILIŠTE VIMAL, SISAK, HRVATSKA
CKKPI, TRAVNIK, BOSNA I HERCEGOVINA
organizuju
31. MEĐUNARODNU KONFERENCIJU
EKONOMSKE, PRAVNE I MEDIJSKE INTEGRACIJE BOSNE I HERCEGOVINE I ZEMALJA ZAPADNOG
BALKANA KAO KLJUČNI POKRETAČ EUROPSKIH VRIJEDNOSTI
12. – 13. decembar 2025. godine
International University of Travnik , Travnik , Bosnia and Herzegovina
International University of Travnik , Travnik , Bosnia and Herzegovina
Supply chain management is the process of planning, implementing and controlling all supply chain activities in the most efficient way possible. Supply chain management systems continually connects the supply, production and distribution of products from suppliers to customers. One of the most important questions managers need to ask when creating a supply chain is: What is the company's competitive advantage? On innovation? At the expense? Quality? Customer-oriented? Depending on the answer to the question asked, managers choose the right models for creating and managing supply chains. The aim of this paper is to determine the shortest path in supply chain management between any two nodes that can be in a travel, communication, computer network by applying a diastrin algorithm. The term shortest does not refer to minimizing the length of the road but to minimizing the weight of the road. The basic research question in the paper is: Is it possible to manage supply chains more efficiently with the use of a diastrin algorithm compared to traditional supply chain management approaches?
Supply Chain Management, Graph, Graph Nodes, Edge Weight, Path Weight, Diastrin Algorithm.
The statements, opinions and data contained in the journal are solely those of the individual authors and contributors and not of the publisher and the editor(s). We stay neutral with regard to jurisdictional claims in published maps and institutional affiliations.
