A generalized assignment problem with special ordered sets: a polyhedral approach. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Math. Program., 2000)

A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Combinatorial Optimization, 2001)

Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Knowl. Eng. Rev., 2001)

A family of facets for the uncapacitated p-median polytope. - Ismael R. de Farias Jr. (Oper. Res. Lett., 2001)

A family of inequalities for the generalized assignment polytope. - Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res. Lett., 2001)

Facets of the Complementarity Knapsack Polytope. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Math. Oper. Res., 2002)

A polyhedral study of the cardinality constrained knapsack problem. - Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Semi-continuous Cuts for Mixed-Integer Programming. - Ismael R. de Farias Jr. (IPCO, 2004)

Models for representing piecewise linear cost functions. - Ahmet B. Keha; Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res. Lett., 2004)

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. - Ahmet B. Keha; Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res., 2006)

The mixing-MIR set with divisible capacities. - Ming Zhao; Ismael R. de Farias Jr. (Math. Program., 2008)

A special ordered set approach for optimizing a discontinuous separable piecewise linear function. - Ismael R. de Farias Jr.; Ming Zhao; Hai Zhao (Oper. Res. Lett., 2008)

A note on the continuous mixing set. - Ming Zhao; Ismael R. de Farias Jr. (Oper. Res. Lett., 2008)

A family of inequalities valid for the robust single machine scheduling polyhedron. - Ismael Regis de Farias Jr.; Hongxia Zhao; Ming Zhao (Comput. Oper. Res., 2010)

A polyhedral study of the semi-continuous knapsack problem. - Ismael Regis de Farias Jr.; Ming Zhao (Math. Program., 2013)

The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints. - Ming Zhao; Ismael Regis de Farias Jr. (Math. Program., 2013)

Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. - Ismael R. de Farias Jr.; Ernee Kozyreff; R. Gupta; Ming Zhao (Math. Program. Comput., 2013)

Branch-and-cut for complementarity-constrained optimization. - Ismael R. de Farias Jr.; Ernee Kozyreff; Ming Zhao (Math. Program. Comput., 2014)

A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs. - Ernee Kozyreff; Ismael R. de Farias Jr. (Comput. Ind. Eng., 2015)

Quantum Walk on the Generalized Birkhoff Polytope Graph. - Rafael Cação; Lucas R. C. T. Cortez; Ismael R. de Farias Jr.; Ernee Kozyreff; Jalil Khatibi Moqadam; Renato Portugal (Entropy, 2021)

The set partitioning problem in a quantum context. - Rafael Cação; Lucas R. C. T. Cortez; Jackson Forner; Hamidreza Validi; Ismael R. de Farias Jr.; Illya V. Hicks (Optim. Lett., 2024)