A hybrid approach to resolving a differentiable integer program

This paper proposes an algorithm to solve differentiable integer programming problems. After linear approximation of the objective function and the constraints, a genetic algorithm is designed to provide an initial solution and to search for a feasible direction at the integer points so that a better integral point can be found. Theoretical analysis and experimental investigation are presented. The result shows that the proposed method guarantees a local optimum and for 12 test problems, the global optima are all obtained.