In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely ...

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 ...