The paper proposes a genetic algorithm based method for nding a good rst integer solu- tion to mixed integer programming problems (MILP). The objective value corresponding to this solution can be used to e ciently prune the search tree in branch and bound type algorithms for MILP. Some preliminary computational results are also presented which support the view that this approach deserves some attention
