We study the discrete intermodal network design problem for freight transportation. We formulate the problem as a mixed-integer nonlinear and non-convex programming model. We formulate a series of equivalent and relaxed mathematical programming models. We present a global optimization algorithm and a nonlinear optimization algorithm to solve the model.