Ismael R. de Farias Jr.

22 papers B 3Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
The set partitioning problem in a quantum context.
Optim. Lett.
Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks
2021 J jnl
Quantum Walk on the Generalized Birkhoff Polytope Graph.
Entropy
Rafael Cação, Lucas R. C. T. Cortez, Ismael R. de Farias Jr., Ernee Kozyreff, Jalil Khatibi Moqadam, Renato Portugal
2015 J jnl
A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs.
Comput. Ind. Eng.
Ernee Kozyreff, Ismael R. de Farias Jr.
2014 J jnl
Branch-and-cut for complementarity-constrained optimization.
Math. Program. Comput.
Ismael R. de Farias Jr., Ernee Kozyreff, Ming Zhao
2013 J jnl
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints.
Math. Program. Comput.
Ismael R. de Farias Jr., Ernee Kozyreff, R. Gupta, Ming Zhao
2008 J jnl
A note on the continuous mixing set.
Oper. Res. Lett.
Ming Zhao, Ismael R. de Farias Jr.
2008 J jnl
A special ordered set approach for optimizing a discontinuous separable piecewise linear function.
Oper. Res. Lett.
Ismael R. de Farias Jr., Ming Zhao, Hai Zhao
2008 J jnl
The mixing-MIR set with divisible capacities.
Math. Program.
Ming Zhao, Ismael R. de Farias Jr.
2006 J jnl
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization.
Oper. Res.
Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
2004 J jnl
Models for representing piecewise linear cost functions.
Oper. Res. Lett.
Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
2004 B conf
Semi-continuous Cuts for Mixed-Integer Programming.
IPCO
Ismael R. de Farias Jr.
2003 J jnl
A polyhedral study of the cardinality constrained knapsack problem.
Math. Program.
Ismael R. de Farias Jr., George L. Nemhauser
2003 J jnl
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.
Math. Program.
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2003 J jnl
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting.
Math. Program.
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2002 B conf
A Polyhedral Study of the Cardinality Constrained Knapsack Problem.
IPCO
Ismael R. de Farias Jr., George L. Nemhauser
2002 J jnl
Facets of the Complementarity Knapsack Polytope.
Math. Oper. Res.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
2002 B conf
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms.
IPCO
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2001 — conf
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.
Combinatorial Optimization
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2001 J jnl
A family of facets for the uncapacitated
Oper. Res. Lett.
Ismael R. de Farias Jr.
2001 J jnl
A family of inequalities for the generalized assignment polytope.
Oper. Res. Lett.
Ismael R. de Farias Jr., George L. Nemhauser
2001 J jnl
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables.
Knowl. Eng. Rev.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
2000 J jnl
A generalized assignment problem with special ordered sets: a polyhedral approach.
Math. Program.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser