A hybrid algorithm for the robust graph coloring problem

保存先:

書誌詳細
著者:	Mora-Gutiérrez, Román Anselmo, Ramírez-Rodríguez, Javier, Rincón-García, Eric A., Ponsich, Antonin, Laureano-Cruces, Ana Lilia
フォーマット:	artículo original
状態:	Versión publicada
出版日付:	2016
その他の書誌記述:	A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP”) and heuristic methods (musical composition method and DSATUR) to resolve the robust graph coloring problem (RGCP) is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.
国:	Portal de Revistas UCR
機関:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
言語:	Inglés
OAI Identifier:	oai:portal.ucr.ac.cr:article/25269
オンライン･アクセス:	https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269
キーワード:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera