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

In this paper we describe computational experience in solving mixed 0-1 programming problems using strong valid inequalities as cutting planes. In particular we report on the solution to optimality of ...