How tight is the corner relaxation?

  title={How tight is the corner relaxation?},
  author={Matteo Fischetti and Michele Monaci},
  journal={Discrete Optimization},
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory’s corner relaxation is obtained by dropping nonnegativity constraints on the basic variables. Although this relaxation received a considerable attention in the literature in the last 40 years, the crucial issue of evaluating the practical quality of the corner-relaxation bound was not addressed so far. In the present paper we report, for the first time, the… CONTINUE READING