default search action
Jean-Philippe P. Richard
Person information
- affiliation: University of Minnesota, Minneapolis, MN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Xiaoyi Gu, Santanu S. Dey
, Jean-Philippe P. Richard:
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. INFORMS J. Comput. 36(3): 884-899 (2024) - [j35]Ankit Bansal
A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling. INFORMS J. Comput. 36(3): 918-937 (2024) - [j34]Jongeun Kim
Piecewise Polyhedral Relaxations of Multilinear Optimization. SIAM J. Optim. 34(4): 3167-3193 (2024) - 2023
- [j33]Alexander S. Estes
Smart Predict-then-Optimize for Two-Stage Linear Programs with Side Information. INFORMS J. Optim. 5(3): 295-320 (2023) - [j32]Xiaoyi Gu, Santanu S. Dey
Lifting convex inequalities for bipartite bilinear programs. Math. Program. 197(2): 587-619 (2023) - 2022
- [j31]Jinhak Kim
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis. Math. Oper. Res. 47(4): 2547-2584 (2022) - 2021
- [j30]Jinke Ming
A Facility Location and Allocation Model for Cooperative Fire Services. IEEE Access 9: 90908-90918 (2021) - [j29]Trang T. Nguyen, Jean-Philippe P. Richard, Mohit Tawarmalani
Convexification techniques for linear complementarity constraints. J. Glob. Optim. 80(2): 249-286 (2021) - [c6]Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Lifting Convex Inequalities for Bipartite Bilinear Programs. IPCO 2021: 148-162
2010 – 2019
- 2019
- [j28]Danial Davarnia
Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling. Oper. Res. 67(4): 1053-1068 (2019) - [j27]Jinhak Kim
On cutting planes for cardinality-constrained linear programs. Math. Program. 178(1-2): 417-448 (2019) - 2018
- [j26]Trang T. Nguyen, Jean-Philippe P. Richard
Deriving convex hulls through lifting and projection. Math. Program. 169(2): 377-415 (2018) - 2017
- [j25]Danial Davarnia, Jean-Philippe P. Richard
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction. SIAM J. Optim. 27(3): 1801-1833 (2017) - 2016
- [j24]Yen Tang, Jean-Philippe P. Richard
A class of algorithms for mixed-integer bilevel min-max optimization. J. Glob. Optim. 66(2): 225-262 (2016) - [j23]I. Ece Içyüz, Jean-Philippe P. Richard
A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem. Transp. Sci. 50(3): 926-946 (2016) - 2015
- [j22]Ali Diabat, Jean-Philippe P. Richard
An integrated supply chain problem: a nested lagrangian relaxation approach. Ann. Oper. Res. 229(1): 303-323 (2015) - [j21]D. L. Burchett, Jean-Philippe P. Richard
Multi-commodity variable upper bound flow models. Discret. Optim. 17: 89-122 (2015) - 2014
- [j20]Kwanghun Chung
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets. Math. Program. 145(1-2): 403-450 (2014) - 2013
- [j19]Ali Diabat
A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design. Ann. Oper. Res. 203(1): 55-80 (2013) - [j18]Mohit Tawarmalani
Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138(1-2): 531-577 (2013) - [j17]Tung H. Le, Ali Diabat
A column generation-based heuristic algorithm for an inventory routing problem with perishable goods. Optim. Lett. 7(7): 1481-1502 (2013) - 2012
- [j16]Ali T. Tuncel, Felisa Preciado, Ronald L. Rardin, Mark P. Langer, Jean-Philippe P. Richard
Strong valid inequalities for fluence map optimization problem under dose-volume restrictions. Ann. Oper. Res. 196(1): 819-840 (2012) - 2011
- [j15]Bo Zeng, Jean-Philippe P. Richard
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting. Discret. Optim. 8(2): 259-276 (2011) - [j14]Bo Zeng, Jean-Philippe P. Richard
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting. Discret. Optim. 8(2): 277-301 (2011) - [j13]Amar Kumar Narisetty, Jean-Philippe P. Richard
Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study. INFORMS J. Comput. 23(3): 416-424 (2011) - [c5]Trang T. Nguyen, Mohit Tawarmalani
Convexification Techniques for Linear Complementarity Constraints. IPCO 2011: 336-348 - 2010
- [j12]Jean-Philippe P. Richard
Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121(1): 61-104 (2010) - [j11]Santanu S. Dey
On the extreme inequalities of infinite group problems. Math. Program. 121(1): 145-170 (2010) - [j10]Santanu S. Dey
Relations between facets of low- and high-dimensional group problems. Math. Program. 123(2): 285-313 (2010) - [j9]Mohit Tawarmalani
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1-2): 481-512 (2010) - [p1]Jean-Philippe P. Richard
The Group-Theoretic Approach in Mixed Integer Programming. 50 Years of Integer Programming 2010: 727-801
2000 – 2009
- 2009
- [j8]Santanu S. Dey
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. INFORMS J. Comput. 21(1): 137-150 (2009) - [j7]Jean-Philippe P. Richard
Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Program. 118(2): 253-277 (2009) - 2008
- [j6]Yanjun Li, Jean-Philippe P. Richard
Cook, Kannan and Schrijver's example revisited. Discret. Optim. 5(4): 724-734 (2008) - [j5]Amar Kumar Narisetty, Jean-Philippe P. Richard
An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad. Interfaces 38(2): 89-102 (2008) - [j4]Santanu S. Dey
Facets of Two-Dimensional Infinite Group Problems. Math. Oper. Res. 33(1): 140-166 (2008) - 2007
- [c4]Santanu S. Dey
Sequential-Merge Facets for Two-Dimensional Group Problems. IPCO 2007: 30-42 - [c3]Bo Zeng, Jean-Philippe P. Richard
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications. IPCO 2007: 210-224 - 2006
- [j3]Hyung Seok Jeong, Jianhong Qiao, Dulcy M. Abraham, Mark A. Lawley, Jean-Philippe P. Richard
Minimizing the Consequences of Intentional Attack on Water Infrastructure. Comput. Aided Civ. Infrastructure Eng. 21(2): 79-92 (2006) - 2003
- [j2]Jean-Philippe P. Richard
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Math. Program. 98(1-3): 89-113 (2003) - [j1]Jean-Philippe P. Richard
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Math. Program. 98(1-3): 115-143 (2003) - 2002
- [c2]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 - 2001
- [c1]Jean-Philippe P. Richard
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. Combinatorial Optimization 2001: 158-170
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: