Ismael R. de Farias Jr.

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 2

Top Topics

Lagrange Multiplier Method

Penalty Functions

Unconstrained Optimization

Top Venues

Comput. Ind. Eng.

Math. Program. Comput.

Publications

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