Year: 2024
Type: article
Abstract: Combinatorial optimization problems play a crucial role in various fields such as logistics, network design, scheduling, and bioinformatics. Graph theory provides a structured approach to model and solve these problems efficiently. This paper explores key graph theoretical techniques for solving combinatorial optimization problems, including shortest path algorithms, maximum flow, minimum spanning tree, and graph coloring. We discuss their mathematical formulations, computational complexity, and real-world applications, emphasizing algorithmic strategies like Dijkstra’s algorithm, the Ford-Fulkerson method, and the Prim-Kruskal approach.
Author: Bijumon Ramalayathil
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4411160705