Publications

Preprints

A. Goyal and J.-P. P. Richard, "Globally Solving a Class of Bilevel Programs with Spatial Price Equilibrium Constraints." Submitted.
J. Kim, J.-P. P. Richard, and M. Tawarmalani, “Piecewise Polyhedral Relaxations of Multilinear Optimization.” Submitted. [here]
J. Kim, J.-P. P. Richard, and M. Tawarmalani, “A Reciprocity Between Tree Ensemble Optimization and Multilinear Optimization.” Submitted. [here]

Mixed Integer Nonlinear Programming

X. Gu, S. S. Dey, and J.-P. P. Richard, "Solving sparse separable bilinear programs using lifted bilinear cover inequalities." to appear, INFORMS Journal on Computing. [here]
A. Estes and J.-P. P. Richard, “Smarter Predict-Then-Optimize for Two-Stage Linear Programs with Side Information,” INFORMS Journal on Optimization, 5, 295-320 (2023). [here]
X. Gu, S. S. Dey, and J-P. P. Richard. “Lifting convex inequalities for bipartite bilinear programs,” Mathematical Programming, 197, 587-619 (2023). [here]
J. Kim, M. Tawarmalani, and J.-P. P. Richard. “Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis,” Mathematics of Operations Research, 47, 2547-2584 (2022). [here]
T. T. Nguyen, J.-P. P. Richard, and M. Tawarmalani. “Convexification techniques for linear complementarity constraints,” Journal on Global Optimization, 80, 249-286 (2021). [here]
J. Kim, M. Tawarmalani, and J.-P. P. Richard. “On cutting planes for cardinality-constrained optimization problems,” Mathematical Programming, 178, 417-448 (2019). [here]
T. T. Nguyen, J.-P. P. Richard, and M. Tawarmalani. “Deriving convex hulls through lifting and projection,” Mathematical Programming, 169, 377-415 (2018). [here]
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 (2017). [here]
Y. Tang, J.-P. P. Richard, and J. C. Smith. “A class of algorithms for mixed-integer bilevel min-max optimization,” Journal on Global Optimization, 66, 225-262 (2016). [here]
K. H. Chung, J.-P P. Richard, and M. Tawarmalani. “Lifted inequalities for 0-1 mixed-integer bilinear covering sets,” Mathematical Programming, 145, 403-450 (2014). [here]
M. Tawarmalani, J.-P P. Richard, and C. X. Xiong, “Explicit convex and concave envelopes through polyhedral subdivisions,” Mathematical Programming, 138, 531-577 (2013). [here]
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). [here]
J.-P. P. Richard and M. Tawarmalani. “Lifting inequalities: a framework for generating strong cuts in nonlinear programming,” Mathematical Programming, 121, 61-104 (2010). [here]

Mixed Integer Linear Programming

A. N. Arslan, J.-P. P. Richard, and Y. Guan. “On the polyhedral structure of two-level lot-sizing problems with supplier selection,” Naval Research Logistics, 8, 647-666 (2016). [here]
D. L. Burchett and J.-P. P. Richard. “Multi-commodity variable upper bound flow models,” Discrete Optimization, 17, 89-122, (2015). [here]
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). [here]
B. Zeng and J.-P. P. Richard. “A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting”, Discrete Optimization, 8, 259-276 (2011). [here]
B. Zeng and J.-P. P. Richard. “A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting”, Discrete Optimization, 8, 277-301 (2011). [here]
S. Dey and J.-P. P. Richard. “Relations between facets of low- and high-dimensional group problems,” Mathematical Programming, 123, 285-313 (2010). [here]
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). [here]
S. Dey and J.-P. P. Richard. “A cut improvement procedure and its application to primal cutting plane algorithms,” INFORMS Journal on Computing, 21, 137-150 (2009). [here]
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). [here]
L. A. Miller, Y. Li, and J.-P. P. Richard. “New families of facets of finite and infinite group problems from approximate lifting,” Naval Research Logistics, 55, 172-191 (2008). [here]
Y. Li and J.-P. P. Richard. “Cook, Kannan and Schrijver’s example revisited,” Discrete Optimization, 5, 724-734 (2008). [here]
S. Dey and J.-P. P. Richard. “Facets of two-dimensional infinite group problems,” Mathematics of Operations Research, 33, 140-166 (2008). [here]
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). [here]
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). [here]

Railroad Applications & Supply Chain

D. Davarnia, J.-P. P. Richard, E. Icyuz-Ay, and B. Taslimi. “Network models with unsplittable node flows with application to unit train scheduling,” Operations Research, 67, 1053-1068 (2019). [here]
I. Icyuz-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). [here]
A. Diabat and J.-P. P. Richard. “An integrated supply chain problem: a nested lagrangian relaxation approach,” Annals of Operations Research, 229, 303-323 (2015). [here]
T. Le, A. Diabat, J.-P. P. Richard, and Y. Yih. “A column generation-based heuristic algorithm for an inventory routing problem with perishable product,” Optimization Letters, 7, 1481-1502 (2013). [here]
A. Diabat, J.-P. P. Richard, and C. W. Codrington “A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design,” Annals of Operations Research, 203, 55-80 (2013) [here]
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). [here]
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 deliveries,” Transportation Research Part B Methodological, 42, 438-454 (2008). [here]

Healthcare Applications

A. Bansal, J.-P. P. Richard, B. P. Berg, and Y. Huang, “A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling," to appear, INFORMS Journal on Computing. [here]
N. Mirzavand Boroujeni, J.-P. P. Richard, D. Sterling, and C. Wilke, “A novel linear network-based optimization model for high dose radiation brachytherapy," Physics in Medicine & Biology, 68, 175018 (2023). [here]

Supplementary Material: [here]

A. T. Tuncel, F. Preciado-Walters, R. L. Rardin, M. Langer and J.-P. P. Richard. “Strong valid inequalities for fluence map optimization problems under dose-volume restrictions,” Annals of Operations Research, 196, 819-840 (2012). [here]

Infrastructure

J. Zhu, J. Ming, J.-P. P. Richard, and R. Qin, “Distributionally Robust Optimization for Fire Station Location under Uncertainties,” Scientific Reports, 12, 5394 (2022). [here]
J. Ming, J.-P. P. Richard, and J. Zhu. “A Facility Location and Allocation Model for Cooperative Fire Services,” IEEE Access, 9, 90908 – 90918 (2021) [here]
J. P. Turner, J. Qiao, M. Lawley, J.-P. P. Richard, and D. Abraham. “Mitigating shortage and distribution in damaged water networks,” Socio-Economic Planning Sciences, 46, 315-326 (2012). [here]
C. A. Arboleda, D. M. Abraham, J.-P. P. Richard, and R. Lubitz. “Vulnerability assessment of health care facilities during disaster events,” ASCE Journal of Infrastructure Systems, 15, 149-161 (2009). [here]
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). [here]
H.S. Jeong, J. Qiao, D.M. Abraham, M. Lawley, J.-P. P. Richard, and Y. Yih. “Minimizing the consequences of intentional attack on water infrastructure,” Computer-Aided Civil and Infrastructure Engineering, 21, 79-92 (2006). [here]

Miscellaneous

M. U. Thomas and J.-P. P. Richard. “Warranty based method for establishing reliability improvement targets,” IIE Transactions, 38, 1049-1058 (2006). [here]

Conference Proceedings

X. Gu, S. Dey, and J.-P. P. Richard. "Lifting Convex inequalities for bipartite bilinear programs,” in M. Singh & David P. Williamson (Eds.): Integer Programming and Combinatorial Optimization 22, Lecture Notes in Computer Science, 127-7, 148-162 (2021). [here]
T. T. Nguyen, M Tawarmalani, and J.-P. P. Richard. “Convexification techniques for linear complementarity constraints,” in O. Gunluk & G. J. Woeginger (Eds.): Integer Programming and Combinatoral Optimization 15. Lecture Notes in Computer Science, 6655, 336-348, (2011). [here]
A. Diabat and J.-P. P. Richard. “Optimization modeling of an integrated supply chain network,” in Proceedings of the 2009 IEEE IEEM. Proceedings, 518-522, 2009. Proceedings available online with IEEE Xplore. [here]
B. Zeng and J.-P. P. Richard. “A framework to derive multidimensional superadditive lifting functions and its applications”, in M. Fischetti & D. P. Williamson (Eds.), Integer Programming and Combinatorial Optimization 12. Lecture Notes in Computer Science 4513, 210-224 (2007). [here]
S. Dey and J.-P. P. Richard. “Sequential-Merge Facets of the two-dimensional group problem”, in M. Fischetti & D. P. Williamson (Eds.), Integer Programming and Combinatorial Optimization 12. Lecture Notes in Computer Science 4513, 30-42 (2007). [here]
C.A. Arboleda, D.M. Abraham, J.-P. P. Richard, and R. Lubitz. “Impact of interdependencies between infrastructure systems in the operation of heath care facilities during disaster events,” in Proceedings of the Joint International Conference on Computing and Decision Making in Civil and Building Engineering (2006) (proceedings on CD-ROM, ISBN 2921145588).
H.S. Jeong, J. Qiao, D.M. Abraham, M. Lawley, J.-P. P. Richard, and Y. Yih. “A consequence mitigation model for water networks subject to intentional physical attacks,” in L. Soibelman & F. Pena-Mora (Eds.), Proceedings of the 2005 ASCE International Conference of Computing in Civil Engineering, (2005) (proceedings on CD-ROM, ISBN 0784407940). [here]
H. S. Jeong, D. M. Abraham, J. Qiao, M. Lawley, J.-P. P. Richard, and Y. Yih. “Issues in risk management of water networks against intentional attacks,” in J.J. Galleher & M.T. Stift (Eds.), Proceedings of the 2004 ASCE International Conference on Pipeline Engineering and Construction (2004) (proceedings on CD-ROM, ISBN 0784407452). [here]
J.-P. P. Richard, I. R. de Farias, and G.L. Nemhauser. “A simplex based algorithm for 0-1 mixed integer programming,” in M. Junger, G. Reinelt & G. Rinaldi (Eds.), Combinatorial Optimization – Eureka, You Shrink! Lecture Notes in Computer Science 2570, 158-170 (2003). [here]
J.-P. P. Richard, I. R. de Farias, and G.L. Nemhauser. “Lifted inequalities for 0-1 mixed integer programming: basic theory and algorithms,” in W. J. Cook & A. S. Schulz (Eds.), Integer Programming and Combinatorial Optimization 9. Lecture Notes in Computer Science 2337, 161-175 (2002). [here]

Book Chapters

J.-P. P. Richard. ”Optimization Models and Methods”, Maynard’s Industrial and Systems Engineering Handbook, 6th Edition (2022).
J.-P. P. Richard. ”Inequalities from group relaxations”, Wiley Encyclopedia of Operations Research and Management Science (2011), doi: 10.1002/9780470400531.eorms0402. [here]
J.-P. P. Richard. ”Lifting techniques for mixed integer programming”, Wiley Encyclopedia of Operations Research and Management Science (2011), doi: 10.1002/9780470400531.eorms0464. [here]
J.-P. P. Richard and S. Dey. “The group-theoretic approach to mixed integer programming,” in 50 Years of Integer Programming 1958-2008, eds Junger et al., Springer, 727-801 (2010). [here]