A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too ...

The optimization problem is formulated as a mixed-integer linear program and a test network is solved by branch-and-bound techniques using IBM's MPSX package. Transportation Science published by ...