Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal International Journal of Applied Mathematics and Computing.
Syed Hassan Ali
Unknown Affiliation
Computer Science & IT Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Computational Simulation and Algorithm Analysis for Solving Combinatorial Optimization Problems in Graph Theory and Discrete Mathematics Dwi Oktaviana; M. Rhifky Wayahdi; Syed Hassan Ali
International Journal of Applied Mathematics and Computing Vol. 1 No. 3 (2024): July : International Journal of Applied Mathematics and Computing
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/ijamc.v1i3.273

Abstract

Combinatorial optimization is a fundamental area in operations research and computer science, focusing on identifying optimal solutions from a finite set of possibilities. This study explores the integration of branch and bound methods with heuristic algorithms to address optimization problems in graph theory and discrete mathematics. Python was employed for algorithm implementation due to its flexibility and comprehensive computational libraries, enabling efficient data analysis and visualization. Several benchmark problems were examined, including the Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), and Graph Coloring. Simulations were conducted using datasets of varying sizes (small, medium, and large) to evaluate performance across different scales. The results demonstrate that the hybrid approach achieves a balance between solution quality and computational efficiency, outperforming brute-force methods in terms of speed while maintaining near-optimal accuracy. Tabulated results and graphical comparisons highlight the reduction in computation time and improved scalability of the proposed method. The findings suggest that combining systematic search strategies with heuristics offers a practical and effective framework for solving complex combinatorial optimization problems. Recommendations for future research include testing scalability with larger datasets, incorporating advanced metaheuristics, and applying the approach to real-world domains such as logistics and network design.
Co-Authors M. Rhifky Wayahdi