Jean-Philippe P. Richard
Affiliations: | Industrial Engineering | Purdue University, West Lafayette, IN, United States |
Area:
Operations Research, Industrial EngineeringGoogle:
"Jean-Philippe Richard"Bio:
Parents
Sign in to add mentorGeorge L. Nemhauser | grad student | 2002 | Georgia Tech | |
(Lifted Inequalities for 0-1 Mixed Integer Programming.) |
Children
Sign in to add traineeSantanu S. Dey | grad student | 2007 | Purdue |
Bo Zeng | grad student | 2007 | Purdue |
Ali Diabat | grad student | 2008 | Purdue |
Chuanhui Xiong | grad student | 2011 | Purdue |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Nguyen TT, Richard JP, Tawarmalani M. (2018) Deriving convex hulls through lifting and projection Mathematical Programming. 169: 377-415 |
Davarnia D, Richard JP, Tawarmalani M. (2017) Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction Siam Journal On Optimization. 27: 1801-1833 |
Arslan AN, Richard JP, Guan Y. (2016) On the polyhedral structure of two‐level lot‐sizing problems with supplier selection Naval Research Logistics. 63: 647-666 |
Le T, Diabat A, Richard JP, et al. (2013) A column generation-based heuristic algorithm for an inventory routing problem with perishable goods Optimization Letters. 7: 1481-1502 |
Diabat A, Richard JP, Codrington CW. (2013) A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design Annals of Operations Research. 203: 55-80 |
Chung K, Richard JP, Tawarmalani M. (2013) Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets Mathematical Programming. 145: 403-450 |
Tawarmalani M, Richard JP, Xiong C. (2013) Explicit convex and concave envelopes through polyhedral subdivisions Mathematical Programming. 138: 531-577 |
Zeng B, Richard JP. (2011) A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting Discrete Optimization. 8: 277-301 |
Zeng B, Richard JP. (2011) A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting Discrete Optimization. 8: 259-276 |
Tawarmalani M, Richard JP, Chung K. (2010) Strong valid inequalities for orthogonal disjunctions and bilinear covering sets Mathematical Programming. 124: 481-512 |