An integer linear program method is developed to deal with the problem of finding link-disjoint paths for QoS routing. Firstly, a set of 0-1 variables is given to model link-disjoint paths and QoS constraints. Then the complicating constraints are included in the objective function of the integer linear program problem formulated by Lagrangian multipliers. The integer linear program problem can be solved rapidly by using simplex algorithm for the totally unimodular of the constraint matrix. Furthermore link-disjoint paths for QoS routing can be found in the iterate process of solving linear program problems. Numerical experiment results show the effectiveness of the proposed method.