This paper presents an efficient GRASP-based algorithm to address the Budget Influence Maximization Problem (BIMP), in which the goal is to select a seed set of users in a social network to maximize the spread of influence subject to a budget constraint.