Proposing a Pure Binary Linear Programming(PBLP) Model to Discover Eulerian Circuits in Complete Graphs
سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 137
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIMES-3-2_006
تاریخ نمایه سازی: 27 بهمن 1402
چکیده مقاله:
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.
کلیدواژه ها:
نویسندگان
Hossein Jafari *
Young Researchers and Elite Club, Arak Branch, Islamic Azad University, Arak, Iran.
Amir-Reza Feizi-Derakhshi
Department of Computer Engineering, University of Tabriz, Tabriz, Iran.
Setareh Salehfard
Department of Computer Science, Arak Branch, Islamic Azad University, Arak, Iran.
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :