University of Florida Term Professorship, 2017-2019
IIE Transactions Best Application Paper Award, 2008
NSF CAREER award, 2004
Sigma Xi Best Ph.D. Thesis Award, Georgia Institute of Technology, 2003
Jean-Philippe P. Richard is a professor of the Department of Industrial and Systems Engineering (ISyE) at the University of Minnesota. Within the department, he is serving as Director of Faculty and Academic Affairs. Prior to joining the University, Jean-Philippe held academic positions at Purdue and more recently at the University of Florida where he was a UF term professor and Industrial and Systems Engineering PhD coordinator. His research interests are in the theoretical and computational aspects of mathematical optimization (integer and mixed integer nonlinear programming). He is particularly interested in convexification methods and polyhedral approaches to these problems. He is also interested in the application of these techniques in data, medicine, transportation, and infrastructure protection.
Jean-Philippe has carried cooperative research with several Class I railroads. His research has been funded by NSF, Union Pacific, and CSX. He is an associate editor for JOGO, IISE Transactions, Optimization Letters, and IMAMAN. He is the recipient of an NSF CAREER award, multiple teaching awards, and the best application paper award from IIE Transactions.
Jinhak Kim, Mohit Tawarmalani, and Jean-Philippe P. Richard, "Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis," forthcoming, Mathematics of Operations Research.
Xiaoyi Gu, Santanu Dey and Jean-Philippe P. Richard, “Lifting Convex Inequalities for Bipartite Bilinear Programs,” forthcoming, Mathematical Programming
D. Davarnia, J.-P. Richard, E. I. Icyuz-Ay, B. Taslimi, “Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling,” Operations Research, 67(4), 905-1208.
J. Kim, M. Tawarmalani, and J.-P. Richard. “On cutting planes for cardinality-constrained optimization problems,” forthcoming, Mathematical Programming.
T. T. Nguyen, J.-P. P. Richard, and M. Tawarmalani, “Deriving convex hulls through lifting and projection,” Mathematical Programming, 169, 377-415, 2018.
D. Davarnia, J.-P. P. Richard, and M. Tawarmalani, “Simultaneous convexification of bilinear functions over polytopes with application to network interdiction,” SIAM Journal on Optimization, 27, 1801- 1833, 2018.
I. E. Içyüz-Ay, J-P P. Richard, E. Eskigun, and D. Acharya. “A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem,” Transportation Science, 50, 926-946, 2016.
M. Tawarmalani, J.-P P. Richard and C. X. Xiong, “Explicit convex and concave envelopes through polyhedral subdivisions,” Mathematical Programming, 138,531-577, 2013.
A. Narisetty, J.-P. P. Richard, and G. L. Nemhauser “Lifted tableaux inequalities for 0-1 mixed-integer programs: a computational study,” Informs Journal on Computing, 23, 416-424, 2011.
M. Tawarmalani , J.-P. P. Richard and K. H. Chung. “Strong valid Inequalities for orthogonal disjunctions and bilinear covering sets,” Mathematical Programming, 124, 481-512, 2010.
S. Dey and J.-P. P. Richard. “Relations between facets of low- and high-dimensional group problems,” Mathematical Programming, 123, 285-313, 2010.
J.-P. P. Richard and M. Tawarmalani. “Lifting inequalities: a framework for generating strong cuts in nonlinear programming,” Mathematical Programming, 121, 61-104, 2010.
S. Dey, J.-P. P. Richard, Y. Li and L. Miller. “On the extreme inequalities of infinite group problems,” Mathematical Programming, 121, 145-170, 2010.
J.-P. P. Richard, Y. Li and L. Miller. “Valid inequalities for MIPs and group polyhedra from approximate liftings,” Mathematical Programming, 118, 253-277, 2009.
A. Narisetty, J.-P. P. Richard, D. Ramcharan, D. Murphy, G. Minsk, and J. Fuller. “An optimization model for empty freight car assignment at Union Pacific Railroad,” Interfaces, 38, 89-102, 2008.
M. Lawley, V. Parmeshwaran, J.-P. P. Richard, A. Turkcan, A. Dalal and D. Ramcharan. “A time-space scheduling model for optimizing recurring bulk railcar,” Transportation Research Part B Methodological, 42, 438-454, 2008.
Y. Li and J.-P. P. Richard. “Cook, Kannan and Schrijver’s example revisited,” Discrete Optimization, 5, 724-734, 2008.
S. Dey and J.-P. P. Richard. “Facets of two-dimensional infinite group problems,” Mathematics of Operations Research, 33, 140-166, 2008.
J. Qiao, H.S. Jeong, M. Lawley, J.-P. P. Richard, D.M. Abraham, and Y. Yih. “Allocating security resources in water infrastructure,” IIE Transactions, 39, 95-109, 2007.
J.-P. P. Richard, I. R. de Farias and G.L. Nemhauser. “Lifted inequalities for 0-1 mixed integer programming: superlinear lifting”, Mathematical Programming, 98, 115-143, 2003.
J.-P. P. Richard, I. R. de Farias and G.L. Nemhauser. “Lifted inequalities for 0-1 mixed integer programming: basic theory and algorithms”, Mathematical Programming, 98, 89-113, 2003.