# Ismael R. de Farias - Publications

## Affiliations: | Industrial Engineering | State University of New York, Buffalo, Buffalo, NY, United States |

##### Area:

Industrial EngineeringYear | Citation | Score | |||
---|---|---|---|---|---|

2015 | Kozyreff E, De Farias IR. A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs Computers and Industrial Engineering. 82: 1-7. DOI: 10.1016/j.cie.2014.08.014 |
1 | |||

2014 | de Farias IR, Kozyreff E, Zhao M. Branch-and-cut for complementarity-constrained optimization Mathematical Programming Computation. 6: 365-403. DOI: 10.1007/s12532-014-0070-2 |
1 | |||

2013 | de Farias IR, Kozyreff E, Gupta R, Zhao M. Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints Mathematical Programming Computation. 5: 75-112. DOI: 10.1007/s12532-012-0049-9 |
1 | |||

2013 | De Farias IR, Zhao M. A polyhedral study of the semi-continuous knapsack problem Mathematical Programming. 142: 169-203. DOI: 10.1007/s10107-012-0566-3 |
1 | |||

2013 | Zhao M, De Farias IR. The piecewise linear optimization polytope: New inequalities and intersection with semi-continuous constraints Mathematical Programming. 141: 217-255. DOI: 10.1007/s10107-012-0517-z |
1 | |||

2010 | de Farias IR, Zhao H, Zhao M. A family of inequalities valid for the robust single machine scheduling polyhedron Computers and Operations Research. 37: 1610-1614. DOI: 10.1016/j.cor.2009.12.001 |
1 | |||

2008 | Zhao M, de Farias IR. A note on the continuous mixing set Operations Research Letters. 36: 726-733. DOI: 10.1016/j.orl.2008.08.001 |
1 | |||

2008 | de Farias IR, Zhao M, Zhao H. A special ordered set approach for optimizing a discontinuous separable piecewise linear function Operations Research Letters. 36: 234-238. DOI: 10.1016/j.orl.2007.05.004 |
1 | |||

2008 | Zhao M, De Farias IR. The mixing-MIR set with divisible capacities Mathematical Programming. 115: 73-103. DOI: 10.1007/s10107-007-0140-6 |
1 | |||

2006 | Keha AB, De Farias IR, Nemhauser GL. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization Operations Research. 54: 847-858. DOI: 10.1287/opre.1060.0277 |
1 | |||

2004 | Keha AB, De Farias IR, Nemhauser GL. Models for representing piecewise linear cost functions Operations Research Letters. 32: 44-48. DOI: 10.1016/S0167-6377(03)00059-2 |
1 | |||

2004 | De Farias IR. Semi-continuous cuts for mixed-integer programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3064: 163-177. |
1 | |||

2003 | Richard JPP, De Farias IR, Nemhauser GL. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting Mathematical Programming. 98: 115-143. DOI: 10.1007/s10107-003-0399-1 |
1 | |||

2003 | Richard JPP, De Farias IR, Nemhauser GL. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms Mathematical Programming. 98: 89-113. DOI: 10.1007/s10107-003-0398-2 |
1 | |||

2003 | Richard JPP, De Farias IR, Nemhauser GL. A simplex-based algorithm for 0-1 mixed integer programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2570: 158-170. |
1 | |||

2002 | De Farias IR, Nemhauser GL. A polyhedral study of the cardinality constrained knapsack problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2337: 291-303. DOI: 10.1007/s10107-003-0420-8 |
1 | |||

2002 | De Farias IR, Nemhauser GL. A polyhedral study of the cardinality constrained knapsack problem |
1 | |||

2002 | De Farias IR, Johnson EL, Nemhauser GL. Facets of the complementarity knapsack polytope Mathematics of Operations Research. 27: 210-226. |
1 | |||

2001 | De Farias IR, Johnson EL, Nemhauser GL. Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables Knowledge Engineering Review. 16: 25-39. DOI: 10.1017/S0269888901000030 |
1 | |||

2001 | De Farias IR, Nemhauser GL. A family of inequalities for the generalized assignment polytope Operations Research Letters. 29: 49-55. DOI: 10.1016/S0167-6377(01)00086-4 |
1 | |||

2001 | De Farias IR. A family of facets for the uncapacitated p-median polytope Operations Research Letters. 28: 161-167. DOI: 10.1016/S0167-6377(01)00062-1 |
1 | |||

2000 | De Farias IR, Johnson EL, Nemhauser GL. A generalized assignment problem with special ordered sets: A polyhedral approach Mathematical Programming, Series B. 89: 187-203. DOI: 10.1007/s101070000185 |
1 | |||

Show low-probability matches. |