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 computational results suggest that some compromise is needed when the problem contains more than a modest number of integer variables. OR professionals in every field of study will find ...