Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we propose and analyze computationally an ...

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