Combinatorial Benders’ Cuts for Mixed-Integer Linear Programming (2008)
Gianni Codato, Matteo Fischetti
Mixed-Integer Programs (MIP’s) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and analyze computationally...