Nuriyeva, FidanUgurlu, OnurKutucu, Hakan2019-10-272019-10-272013978-1-4673-6419-52378-82322472-85862378-82322472-8586https://hdl.handle.net/11454/482177th International Conference on Application of Information and Communication Technologies (AICT) -- OCT 23-25, 2013 -- Baku, AZERBAIJANThe rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.eninfo:eu-repo/semantics/closedAccessRainbow connectionmathematical modellingoptimizationConference Object24WOS:000345830600001N/AN/A