Ismael R. de Farias

Industrial Engineering State University of New York, Buffalo, Buffalo, NY, United States 
Industrial Engineering
"Ismael de Farias"


Sign in to add mentor
George L. Nemhauser grad student 1995 Georgia Tech
 (A Polyhedral Approach to Combinatorial Complementarity Programming Problems.)
BETA: Related publications


You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Kozyreff E, De Farias IR. (2015) A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs Computers and Industrial Engineering. 82: 1-7
de Farias IR, Kozyreff E, Zhao M. (2014) Branch-and-cut for complementarity-constrained optimization Mathematical Programming Computation. 6: 365-403
de Farias IR, Kozyreff E, Gupta R, et al. (2013) Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints Mathematical Programming Computation. 5: 75-112
De Farias IR, Zhao M. (2013) A polyhedral study of the semi-continuous knapsack problem Mathematical Programming. 142: 169-203
Zhao M, De Farias IR. (2013) The piecewise linear optimization polytope: New inequalities and intersection with semi-continuous constraints Mathematical Programming. 141: 217-255
de Farias IR, Zhao H, Zhao M. (2010) A family of inequalities valid for the robust single machine scheduling polyhedron Computers and Operations Research. 37: 1610-1614
Zhao M, de Farias IR. (2008) A note on the continuous mixing set Operations Research Letters. 36: 726-733
de Farias IR, Zhao M, Zhao H. (2008) A special ordered set approach for optimizing a discontinuous separable piecewise linear function Operations Research Letters. 36: 234-238
Zhao M, De Farias IR. (2008) The mixing-MIR set with divisible capacities Mathematical Programming. 115: 73-103
Keha AB, De Farias IR, Nemhauser GL. (2006) A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization Operations Research. 54: 847-858
See more...