| Models for representing piecewise linear cost functions AB Keha, IR de Farias Jr, GL Nemhauser Operations Research Letters 32 (1), 44-48, 2004 | 213 | 2004 |
| A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization AB Keha, IR de Farias Jr, GL Nemhauser Operations research 54 (5), 847-858, 2006 | 117 | 2006 |
| Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms JPP Richard, IR de Farias Jr, GL Nemhauser Mathematical programming 98 (1), 89-113, 2003 | 69 | 2003 |
| A polyhedral study of the cardinality constrained knapsack problem IR de Farias Jr, GL Nemhauser Mathematical programming 96, 439-467, 2003 | 67 | 2003 |
| Branch-and-cut for combinatorial optimization problems without auxiliary binary variables IR De Farias, EL Johnson, GL Nemhauser The Knowledge Engineering Review 16 (1), 25-39, 2001 | 59 | 2001 |
| A generalized assignment problem with special ordered sets: a polyhedral approach IR de Farias, Jr, EL Johnson, GL Nemhauser Mathematical Programming 89, 187-203, 2000 | 59 | 2000 |
| Facets of the complementarity knapsack polytope IR De Farias Jr, EL Johnson, GL Nemhauser Mathematics of Operations Research 27 (1), 210-226, 2002 | 53 | 2002 |
| A family of facets for the uncapacitated p-median polytope IR de Farias Jr Operations research letters 28 (4), 161-167, 2001 | 50 | 2001 |
| Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting JPP Richard, IR de Farias Jr, GL Nemhauser Mathematical programming 98 (1), 115-143, 2003 | 42 | 2003 |
| A special ordered set approach for optimizing a discontinuous separable piecewise linear function IR de Farias Jr, M Zhao, H Zhao Operations Research Letters 36 (2), 234-238, 2008 | 39 | 2008 |
| A family of inequalities for the generalized assignment polytope IR de Farias Jr, GL Nemhauser Operations Research Letters 29 (2), 49-55, 2001 | 35 | 2001 |
| A family of inequalities valid for the robust single machine scheduling polyhedron H Zhao, M Zhao Computers & operations research 37 (9), 1610-1614, 2010 | 34 | 2010 |
| The mixing-MIR set with divisible capacities M Zhao, IR de Farias Jr Mathematical Programming 115 (1), 73-103, 2008 | 27 | 2008 |
| A polyhedral study of the semi-continuous knapsack problem IR De Farias, M Zhao Mathematical Programming 142, 169-203, 2013 | 18 | 2013 |
| Semi-continuous cuts for mixed-integer programming IR de Farias Jr International Conference on Integer Programming and Combinatorial …, 2004 | 17 | 2004 |
| Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints IR de Farias, E Kozyreff, R Gupta, M Zhao Mathematical Programming Computation 5, 75-112, 2013 | 13 | 2013 |
| A polyhedral approach to combinatorial complementarity programming problems IR de Farias Jr Georgia Institute of Technology, 1995 | 13 | 1995 |
| Branch-and-cut for complementarity-constrained optimization IR de Farias, E Kozyreff, M Zhao Mathematical Programming Computation 6, 365-403, 2014 | 12 | 2014 |
| A comparison between evolutionary metaheuristics and mathematical optimization to solve the wells placement problem G AlQahtani, A Alzahabi, E Kozyreff, IR de Jr, M Soliman Advances in Chemical Engineering and Science 2013, 2013 | 12 | 2013 |
| The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints M Zhao, IR De Farias Mathematical Programming 141, 217-255, 2013 | 10 | 2013 |
