The double digestion problem for DNA restriction mapping is known to be NP-complete. Several approaches to the problem have been used including exhaustive search, simulated annealing, branch-and-bound. In this paper, we consider a mixed-integer linear programming formulation of the problem and show that with this formulation the problem can be solved efficiently to a fairly large size using state-of-the-art integer programming techniques. In particular, we present computational results obtained by using the CPLEX mixed-integer linear programming software on a set of randomly generated, large-scale double digestion problems.