Ismael Regis de Farias Jr.
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j13 | Ismael R. de Farias Jr., E. Kozyreff, R. Gupta, Ming Zhao: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. Math. Program. Comput. 5(1): 75-112 (2013) | |
| 2010 | ||
| j12 | Ismael Regis de Farias Jr., Hongxia Zhao, Ming Zhao: A family of inequalities valid for the robust single machine scheduling polyhedron. Computers & OR 37(9): 1610-1614 (2010) | |
| 2008 | ||
| j11 | Ming Zhao, Ismael R. de Farias Jr.: The mixing-MIR set with divisible capacities. Math. Program. 115(1): 73-103 (2008) | |
| j10 | 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) | |
| j9 | Ming Zhao, Ismael R. de Farias Jr.: A note on the continuous mixing set. Oper. Res. Lett. 36(6): 726-733 (2008) | |
| 2006 | ||
| j8 | 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 | ||
| j7 | 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) | |
| c4 | ||
| 2003 | ||
| j6 | Ismael R. de Farias Jr., George L. Nemhauser: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003) | |
| j5 | 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): 89-113 (2003) | |
| j4 | 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): 115-143 (2003) | |
| 2002 | ||
| j3 | 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) | |
| c3 | 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 | |
| c2 | Ismael R. de Farias Jr., George L. Nemhauser: A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303 | |
| 2001 | ||
| j2 | Ismael R. de Farias Jr.: A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. 28(4): 161-167 (2001) | |
| j1 | 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) | |
| c1 | 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 | |
| 1 | R. Gupta | |
| 2 | Ellis L. Johnson | |
| 3 | Ahmet B. Keha | |
| 4 | E. Kozyreff | |
| 5 | George L. Nemhauser | |
| 6 | Jean-Philippe P. Richard | |
| 7 | Hai Zhao | |
| 8 | Hongxia Zhao | |
| 9 | Ming Zhao |
Colors in the list of coauthors
Last update Fri May 24 10:50:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page