default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Pauphilet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Dick den Hertog
, Jean Pauphilet, Mohamed Yahya Soali:
Minkowski Centers via Robust Optimization: Computation and Applications. Oper. Res. 72(5): 2135-2152 (2024)- [j15]Sanjay Jain, Jónas Oddur Jónasson, Jean Pauphilet, Kamalini Ramdas:
Robust Combination Testing: Methods and Application to COVID-19 Detection. Manag. Sci. 70(4): 2661-2681 (2024) - [j14]Dimitris Bertsimas, Jean Pauphilet:
Hospital-Wide Inpatient Flow Optimization. Manag. Sci. 70(7): 4893-4911 (2024) - [j13]Jean Pauphilet:
Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items. Manuf. Serv. Oper. Manag. 26(1): 11-27 (2024) - [j12]Dimitris Bertsimas, Arthur Delarue, Jean Pauphilet:
Simple Imputation Rules for Prediction with Missing Data: Theoretical Guarantees vs. Empirical Performance. Trans. Mach. Learn. Res. 2024 (2024) - [i11]Dimitris Bertsimas, Arthur Delarue, Jean Pauphilet:
Adaptive Optimization for Prediction with Missing Data. CoRR abs/2402.01543 (2024) - 2023
- [j11]Dimitris Bertsimas, Dick den Hertog, Jean Pauphilet, Jianzhe Zhen:
Robust convex optimization: A new perspective that unifies and extends. Math. Program. 200(2): 877-918 (2023) - [j10]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
A new perspective on low-rank optimization. Math. Program. 202(1): 47-92 (2023) - [j9]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
Publisher Correction to: A new perspective on low-rank optimization. Math. Program. 202(1): 93-94 (2023) - [i10]Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo, Jean Pauphilet:
Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions. CoRR abs/2305.12292 (2023) - [i9]Liangyuan Na, Kimberly Villalobos Carballo, Jean Pauphilet, Ali Haddad-Sisakht, Daniel Kombert, Melissa Boisjoli-Langlois, Andrew Castiglione, Maram Khalifa, Pooja Hebbal, Barry Stein, Dimitris Bertsimas:
Patient Outcome Predictions Improve Operations at a Large Hospital Network. CoRR abs/2305.15629 (2023) - 2022
- [j8]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints. Oper. Res. 70(6): 3321-3344 (2022) - [j7]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality. J. Mach. Learn. Res. 23: 13:1-13:35 (2022) - [j6]Dimitris Bertsimas, Jean Pauphilet, Jennifer P. Stevens, Manu Tandon:
Predicting Inpatient Flow at a Major Hospital Using Interpretable Analytics. Manuf. Serv. Oper. Manag. 24(6): 2809-2824 (2022) - [i8]Julien Grand-Clément, Jean Pauphilet:
The Best Decisions Are Not the Best Advice: Making Adherence-Aware Recommendations. CoRR abs/2209.01874 (2022) - [i7]Ryan Cory-Wright, Jean Pauphilet:
Sparse PCA With Multiple Components. CoRR abs/2209.14790 (2022) - 2021
- [j5]Hanyu Gao, Jean Pauphilet, Thomas J. Struble, Connor W. Coley, Klavs F. Jensen:
Direct Optimization across Computer-Generated Reaction Networks Balances Materials Use and Feasibility of Synthesis Plans for Molecule Libraries. J. Chem. Inf. Model. 61(1): 493-504 (2021) - [j4]Dimitris Bertsimas, Jean Pauphilet, Bart P. G. Van Parys:
Sparse classification: a scalable discrete optimization perspective. Mach. Learn. 110(11): 3177-3209 (2021) - [j3]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints. SIAM J. Optim. 31(3): 2340-2367 (2021) - [j2]Dimitris Bertsimas, Dick den Hertog, Jean Pauphilet:
Probabilistic Guarantees in Robust Optimization. SIAM J. Optim. 31(4): 2893-2920 (2021) - [i6]Dimitris Bertsimas, Arthur Delarue, Jean Pauphilet:
Prediction with Missing Data. CoRR abs/2104.03158 (2021) - [i5]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
A new perspective on low-rank optimization. CoRR abs/2105.05947 (2021) - 2020
- [j1]Dimitris Bertsimas, Jourdain B. Lamperski, Jean Pauphilet:
Certifiably optimal sparse inverse covariance estimation. Math. Program. 184(1): 491-530 (2020) - [i4]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality. CoRR abs/2005.05195 (2020) - [i3]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints. CoRR abs/2009.10395 (2020)
2010 – 2019
- 2019
- [i2]Dimitris Bertsimas, Jourdain B. Lamperski, Jean Pauphilet:
Certifiably Optimal Sparse Inverse Covariance Estimation. CoRR abs/1906.10283 (2019) - [i1]Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
A unified approach to mixed-integer optimization: Nonlinear formulations and scalable algorithms. CoRR abs/1907.02109 (2019) - 2016
- [c1]Jean Pauphilet, Diego Kiner, Damien Faille, Laurent El Ghaoui:
A tractable numerical strategy for robust MILP and application to energy management. CDC 2016: 1490-1495
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-10-23 20:28 CEST 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:
