Ismael R. de Farias
Affiliations: | Industrial Engineering | State University of New York, Buffalo, Buffalo, NY, United States |
Area:
Industrial EngineeringGoogle:
"Ismael de Farias"Parents
Sign in to add mentorGeorge L. Nemhauser | grad student | 1995 | Georgia Tech | |
(A Polyhedral Approach to Combinatorial Complementarity Programming Problems.) |
BETA: Related publications
See more...
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. |
Cação R, Cortez L, de Farias I, et al. (2021) Quantum Walk on the Generalized Birkhoff Polytope Graph. Entropy (Basel, Switzerland). 23 |
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, 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 M, Zhao H. (2008) A special ordered set approach for optimizing a discontinuous separable piecewise linear function Operations Research Letters. 36: 234-238 |
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 |
Keha AB, De Farias IR, Nemhauser GL. (2004) Models for representing piecewise linear cost functions Operations Research Letters. 32: 44-48 |
Richard JPP, De Farias IR, Nemhauser GL. (2003) Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting Mathematical Programming. 98: 115-143 |
Richard JPP, De Farias IR, Nemhauser GL. (2003) Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms Mathematical Programming. 98: 89-113 |