Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Two-step mixed integer rounding (MIR) inequalities are valid inequalities derived from a facet of a simple mixed integer set with three variables and one constraint. In this paper we investigate how to effectively use these inequalities as cutting planes for general mixed integer problems. We study the separation problem for single-constraint sets and show that it can be solved in polynomial time when the resulting inequality is required to be sufficiently different from the associated MIR inequalities. We discuss computational issues and present numerical results based on a number of data sets. © 2010 INFORMS.
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Yao Qi, Raja Das, et al.
ISSTA 2009