Classic colouring problems as special cases of the soft graph colouring model Online publication date: Fri, 05-Jul-2019
by Daniel E. Urueta-Hinojosa; Pedro Lara-Velázquez; Miguel A. Gutiérrez-Andrade; Sergio G. De-los-Cobos-Silva; Eric A. Rincón-García; Román A. Mora-Gutiérrez; Antonin Ponsich
International Journal of Technology, Policy and Management (IJTPM), Vol. 19, No. 2, 2019
Abstract: Colouring problems can model different problems in the real world. Among the problems of colouring we have the Soft Graph Colouring, in which, given an undirected complete graph with weights on its edges (penalisations), we search to reduce the sum of the penalisations between two vertices painted with the same colour. Also, we have the classic colouring problems, which includes: minimal, weak, equitable and robust colouring. The objective of this work is to develop an integrative model that solves the classic colouring problems through the Soft Graph Colouring model and GRASP metaheuristic algorithm, using particular instances to each colouring problem that allow to compare how efficient the proposed model is; so will be possible to observe the behaviour of Soft Graph Colouring solving other types of colouring problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Technology, Policy and Management (IJTPM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook