A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Combinatorial Optimization, 2001)

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Minimizing the Consequences of Intentional Attack on Water Infrastructure. - Hyung Seok Jeong; Jianhong Qiao; Dulcy M. Abraham; Mark A. Lawley; Jean-Philippe P. Richard; Yuehwern Yih (Comput. Aided Civ. Infrastructure Eng., 2006)

Sequential-Merge Facets for Two-Dimensional Group Problems. - Santanu S. Dey; Jean-Philippe P. Richard (IPCO, 2007)

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications. - Bo Zeng; Jean-Philippe P. Richard (IPCO, 2007)

Cook, Kannan and Schrijver's example revisited. - Yanjun Li; Jean-Philippe P. Richard (Discret. Optim., 2008)

An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad. - Amar Kumar Narisetty; Jean-Philippe P. Richard; David Ramcharan; Deby Murphy; Gayle Minks; Jim Fuller (Interfaces, 2008)

Facets of Two-Dimensional Infinite Group Problems. - Santanu S. Dey; Jean-Philippe P. Richard (Math. Oper. Res., 2008)

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. - Santanu S. Dey; Jean-Philippe P. Richard (INFORMS J. Comput., 2009)

Valid inequalities for MIPs and group polyhedra from approximate liftings. - Jean-Philippe P. Richard; Yanjun Li; Lisa A. Miller (Math. Program., 2009)

The Group-Theoretic Approach in Mixed Integer Programming. - Jean-Philippe P. Richard; Santanu S. Dey (50 Years of Integer Programming, 2010)

Relations between facets of low- and high-dimensional group problems. - Santanu S. Dey; Jean-Philippe P. Richard (Math. Program., 2010)

On the extreme inequalities of infinite group problems. - Santanu S. Dey; Jean-Philippe P. Richard; Yanjun Li; Lisa A. Miller (Math. Program., 2010)

Lifting inequalities: a framework for generating strong cuts for nonlinear programs. - Jean-Philippe P. Richard; Mohit Tawarmalani (Math. Program., 2010)

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. - Mohit Tawarmalani; Jean-Philippe P. Richard; Kwanghun Chung (Math. Program., 2010)

A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting. - Bo Zeng; Jean-Philippe P. Richard (Discret. Optim., 2011)

A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting. - Bo Zeng; Jean-Philippe P. Richard (Discret. Optim., 2011)

Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study. - Amar Kumar Narisetty; Jean-Philippe P. Richard; George L. Nemhauser (INFORMS J. Comput., 2011)

Strong valid inequalities for fluence map optimization problem under dose-volume restrictions. - Ali T. Tuncel; Felisa Preciado; Ronald L. Rardin; Mark P. Langer; Jean-Philippe P. Richard (Ann. Oper. Res., 2012)

A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design. - Ali Diabat; Jean-Philippe P. Richard; Craig W. Codrington (Ann. Oper. Res., 2013)

Explicit convex and concave envelopes through polyhedral subdivisions. - Mohit Tawarmalani; Jean-Philippe P. Richard; Chuanhui Xiong (Math. Program., 2013)

A column generation-based heuristic algorithm for an inventory routing problem with perishable goods. - Tung H. Le; Ali Diabat; Jean-Philippe P. Richard; Yuehwern Yih (Optim. Lett., 2013)

Lifted inequalities for $$0 mathord {-}1$$ mixed-integer bilinear covering sets. - Kwanghun Chung; Jean-Philippe P. Richard; Mohit Tawarmalani (Math. Program., 2014)

An integrated supply chain problem: a nested lagrangian relaxation approach. - Ali Diabat; Jean-Philippe P. Richard (Ann. Oper. Res., 2015)

Multi-commodity variable upper bound flow models. - D. L. Burchett; Jean-Philippe P. Richard (Discret. Optim., 2015)

A class of algorithms for mixed-integer bilevel min-max optimization. - Yen Tang; Jean-Philippe P. Richard; J. Cole Smith (J. Glob. Optim., 2016)

A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem. - I. Ece Içyüz; Jean-Philippe P. Richard; Erdem Eskigun; Dharma Acharya (Transp. Sci., 2016)

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction. - Danial Davarnia; Jean-Philippe P. Richard; Mohit Tawarmalani (SIAM J. Optim., 2017)

Deriving convex hulls through lifting and projection. - Trang T. Nguyen; Jean-Philippe P. Richard; Mohit Tawarmalani (Math. Program., 2018)

Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling. - Danial Davarnia; Jean-Philippe P. Richard; Ece Içyüz-Ay; Bijan Taslimi (Oper. Res., 2019)

On cutting planes for cardinality-constrained linear programs. - Jinhak Kim; Mohit Tawarmalani; Jean-Philippe P. Richard (Math. Program., 2019)

A Facility Location and Allocation Model for Cooperative Fire Services. - Jinke Ming; Jean-Philippe P. Richard; Jiping Zhu (IEEE Access, 2021)

Convexification techniques for linear complementarity constraints. - Trang T. Nguyen; Jean-Philippe P. Richard; Mohit Tawarmalani (J. Glob. Optim., 2021)

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis. - Jinhak Kim; Mohit Tawarmalani; Jean-Philippe P. Richard (Math. Oper. Res., 2022)

Lifting convex inequalities for bipartite bilinear programs. - Xiaoyi Gu; Santanu S. Dey; Jean-Philippe P. Richard (Math. Program., 2023)

Smart Predict-then-Optimize for Two-Stage Linear Programs with Side Information. - Alexander S. Estes; Jean-Philippe P. Richard (INFORMS J. Optim., 2023)

A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling. - Ankit Bansal; Jean-Philippe P. Richard; Bjorn P. Berg; Yu-Li Huang (INFORMS J. Comput., 2024)

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. - Xiaoyi Gu; Santanu S. Dey; Jean-Philippe P. Richard (INFORMS J. Comput., 2024)

Piecewise Polyhedral Relaxations of Multilinear Optimization. - Jongeun Kim; Jean-Philippe P. Richard; Mohit Tawarmalani (SIAM J. Optim., 2024)