WSEAS Transactions on Systems
Print ISSN: 1109-2777, E-ISSN: 2224-2678
Volume 22, 2023
Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS
Author:
Abstract: The graph colouring problem is one of the most studied combinatorial optimisation problems, one with many applications, e.g., in timetabling, resource assignment, team-building problems, network analysis, and cartography. Because of its NP-hardness, the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of an integer programming model in the GAMS environment. This environment makes it possible to solve instances much larger than in the past. Neither does it require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature.
Search Articles
Pages: 532-537
DOI: 10.37394/23202.2023.22.53