 | 2008 |
|---|
| 11 |       | 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): 234-238 (2008) |
| 10 | | Ming Zhao,
Ismael R. de Farias Jr.:
A note on the continuous mixing set.
Oper. Res. Lett. 36(6): 726-733 (2008) |
| 2006 |
|---|
| 9 | | Ahmet B. Keha,
Ismael R. de Farias Jr.,
George L. Nemhauser:
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization.
Operations Research 54(5): 847-858 (2006) |
| 2004 |
|---|
| 8 | | Ahmet B. Keha,
Ismael R. de Farias Jr.,
George L. Nemhauser:
Models for representing piecewise linear cost functions.
Oper. Res. Lett. 32(1): 44-48 (2004) |
| 2003 |
|---|
| 7 | | Ismael R. de Farias Jr.,
George L. Nemhauser:
A polyhedral study of the cardinality constrained knapsack problem.
Math. Program. 96(3): 439-467 (2003) |
| 2002 |
|---|
| 6 | | 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: 161-175 |
| 5 | | Ismael R. de Farias Jr.,
George L. Nemhauser:
A Polyhedral Study of the Cardinality Constrained Knapsack Problem.
IPCO 2002: 291-303 |
| 4 | | Ismael R. de Farias Jr.,
Ellis L. Johnson,
George L. Nemhauser:
Facets of the Complementarity Knapsack Polytope.
Math. Oper. Res. 27(1): 210-226 (2002) |
| 2001 |
|---|
| 3 | | 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: 158-170 |
| 2 | | Ismael R. de Farias Jr.:
A family of facets for the uncapacitated p-median polytope.
Oper. Res. Lett. 28(4): 161-167 (2001) |
| 1 | | Ismael R. de Farias Jr.,
George L. Nemhauser:
A family of inequalities for the generalized assignment polytope.
Oper. Res. Lett. 29(2): 49-55 (2001) |
