Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer networks. Multiple link failure models, such as Shared Risk Link Groups (SRLG), Shared Risk Node Groups (SRNG), and more generally Shared Risk Resource Groups (SRRG), are becoming critical in survivable network design. These shared risk models have been unified through the notion of colored graphs. In this paper we provide an efficient MILP formulation for the minimum color path problem which is related to finding a path of maximum reliability in a multilayer network and is thus essential issue of network survivability.