Proposing a Pure Binary Linear Programming(PBLP) Model to Discover Eulerian Circuits in Complete Graphs
- سال انتشار: 1402
- محل انتشار: ژورنال بین المللی نوآوری در مدیریت، اقتصاد و علوم اجتماعی، دوره: 3، شماره: 2
- کد COI اختصاصی: JR_IJIMES-3-2_006
- زبان مقاله: انگلیسی
- تعداد مشاهده: 112
نویسندگان
Young Researchers and Elite Club, Arak Branch, Islamic Azad University, Arak, Iran.
Department of Computer Engineering, University of Tabriz, Tabriz, Iran.
Department of Computer Science, Arak Branch, Islamic Azad University, Arak, Iran.
چکیده
Known as a branch of Discrete Mathematics (DM), Graph Theory (GT) describes and solves problems of discrete nature through nodes (i.e., vertices) and arcs (i.e., edges). In this regard, a prominent problem is to find the Eulerian circuits. This paper indicates that the problem can be analyzed through operations research methods. In more general terms, finding the Eulerian circuits could be considered a pathfinding problem. Hence, this paper proposes a pure binary mathematical model to describe the relationship between the variables employed to find the Eulerian circuits. All the analyses in this paper were performed in MATLAB. The proposed model can be solved by many optimization software applications. Finally, several numerical examples are presented and solved through the proposed method. All the analyses in this paper were performed in MATLAB. This paper indicated that the problem(Eulerian Circuits in Complete Graphs) could be studied and solved from the perspective of operations research.Known as a branch of Discrete Mathematics (DM), Graph Theory (GT) describes and solves problems of discrete nature through nodes (i.e., vertices) and arcs (i.e., edges). In this regard, a prominent problem is to find the Eulerian circuits. This paper indicates that the problem can be analyzed through operations research methods. In more general terms, finding the Eulerian circuits could be considered a pathfinding problem. Hence, this paper proposes a pure binary mathematical model to describe the relationship between the variables employed to find the Eulerian circuits. All the analyses in this paper were performed in MATLAB. The proposed model can be solved by many optimization software applications. Finally, several numerical examples are presented and solved through the proposed method. All the analyses in this paper were performed in MATLAB. This paper indicated that the problem(Eulerian Circuits in Complete Graphs) could be studied and solved from the perspective of operations research.کلیدواژه ها
Optimization, Graph Theory, Discrete Mathematics, Operations Research, Eulerian Circuit, Pathfindingاطلاعات بیشتر در مورد COI
COI مخفف عبارت CIVILICA Object Identifier به معنی شناسه سیویلیکا برای اسناد است. COI کدی است که مطابق محل انتشار، به مقالات کنفرانسها و ژورنالهای داخل کشور به هنگام نمایه سازی بر روی پایگاه استنادی سیویلیکا اختصاص می یابد.
کد COI به مفهوم کد ملی اسناد نمایه شده در سیویلیکا است و کدی یکتا و ثابت است و به همین دلیل همواره قابلیت استناد و پیگیری دارد.