Dimitris Bertsimas
106 catalog papers. Identity-linked publications and additional name matches are distinguished below.
ORCID: 0000-0002-1985-1003
Publications
- Mixed-Integer Optimization with Constraint Learning — Operations Research 2025
- Early Detection of Opioid Over-Procurement: A Semisupervised Machine Learning Approach — Manufacturing & Service Operations Management 2025
- Decarbonizing OCP — Manufacturing & Service Operations Management 2025
- An Exact Solution to Wordle — Operations Research 2025
- A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design — INFORMS Journal on Computing 2025
- Slowly Varying Regression Under Sparsity — Operations Research 2025
- Reshaping National Organ Allocation Policy — Operations Research 2024
- Hospital-Wide Inpatient Flow Optimization — Management Science 2024
- Interpretable algorithmic fairness in structured and unstructured data — Journal of Machine Learning Research 2024 (name-matched, not ORCID-linked)
- Forecasting COVID-19 and Analyzing the Effect of Government Interventions — Operations Research 2023
- Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach — Journal of Machine Learning Research 2023 (name-matched, not ORCID-linked)
- Sparse PCA: a Geometric Approach — Journal of Machine Learning Research 2023 (name-matched, not ORCID-linked)
- Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization — Operations Research 2023
- Policy Analytics in Public School Operations — Operations Research 2023
- A Prescriptive Machine Learning Approach to Mixed-Integer Convex Optimization — INFORMS Journal on Computing 2023
- Interpretable Matrix Completion: A Discrete Optimization Approach — INFORMS Journal on Computing 2023
- A Data-Driven Approach to Multistage Stochastic Linear Optimization — Management Science 2023
- Stochastic Cutting Planes for Data-Driven Optimization — INFORMS Journal on Computing 2022
- Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality — Journal of Machine Learning Research 2022 (name-matched, not ORCID-linked)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints — Operations Research 2022
- Technical Note—Two-Stage Sample Robust Optimization — Operations Research 2022
- A Scalable Algorithm for Sparse Portfolio Selection — INFORMS Journal on Computing 2022
- Online Mixed-Integer Optimization in Milliseconds — INFORMS Journal on Computing 2022
- Data-Driven Optimization: A Reproducing Kernel Hilbert Space Approach — Operations Research 2022
- Course Scheduling Under Sudden Scarcity: Applications to Pandemic Planning — Manufacturing & Service Operations Management 2022
- Predicting Inpatient Flow at a Major Hospital Using Interpretable Analytics — Manufacturing & Service Operations Management 2022
- Stable Classification — Journal of Machine Learning Research 2022 (name-matched, not ORCID-linked)
- Data-Driven Transit Network Design at Scale — Operations Research 2021
- Sparse Convex Regression — INFORMS Journal on Computing 2021
- Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion — Journal of Machine Learning Research 2020 (name-matched, not ORCID-linked)
- Stable Regression: On the Power of Optimization over Randomization — Journal of Machine Learning Research 2020 (name-matched, not ORCID-linked)
- From Predictive to Prescriptive Analytics — Management Science 2020
- Sparse high-dimensional regression: Exact scalable algorithms and phase transitions — The Annals of Statistics 2020
- Relative Robust and Adaptive Optimization — INFORMS Journal on Computing 2020
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms — Operations Research 2020
- Adaptive Distributionally Robust Optimization — Management Science 2019
- Travel Time Estimation in the Age of Big Data — Operations Research 2019
- Covariate-Adaptive Optimization in Online Clinical Trials — Operations Research 2019
- Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications — Operations Research 2019
- Exact First-Choice Product Line Optimization — Operations Research 2019
- Robust Maximum Likelihood Estimation — INFORMS Journal on Computing 2019
- From Predictive Methods to Missing Data Imputation: An Optimization Approach — Journal of Machine Learning Research 2017 (name-matched, not ORCID-linked)
- Certifiably Optimal Low Rank Factor Analysis — Journal of Machine Learning Research 2017 (name-matched, not ORCID-linked)
- Robust Product Line Design — Operations Research 2017
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions — Operations Research 2016
- Decomposable Markov Decision Processes: A Fluid Optimization Approach — Operations Research 2016
- OR Forum—An Algorithmic Approach to Linear Regression — Operations Research 2016
- Inventory Management in the Era of Big Data — Production and Operations Management 2016
- Best subset selection via a modern optimization lens — The Annals of Statistics 2016
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds — INFORMS Journal on Computing 2016
- An Analytics Approach to Designing Combination Chemotherapy Regimens for Cancer — Management Science 2016
- OR Forum—Tenure Analytics: Models for Predicting Research Impact — Operations Research 2015
- The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples — Operations Research 2015
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization — Operations Research 2015
- Robust Queueing Theory — Operations Research 2015
- Introduction to the Special Issue on Business Analytics — Management Science 2014
- Least quantile regression via modern optimization — The Annals of Statistics 2014
- Learning Preferences Under Noise and Loss Aversion: An Optimization Approach — Operations Research 2013
- Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation — Operations Research 2013
- Robust and Adaptive Network Flows — Operations Research 2013
- A New Local Search Algorithm for Binary Optimization — INFORMS Journal on Computing 2013
- On the Efficiency-Fairness Trade-off — Management Science 2012
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012 (name-matched, not ORCID-linked)
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012 (name-matched, not ORCID-linked)
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012 (name-matched, not ORCID-linked)
- Inverse Optimization: A New Perspective on the Black-Litterman Model — Operations Research 2012
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012 (name-matched, not ORCID-linked)
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012
- Call for Papers—Special Issue ofManagement Science: Business Analytics — Management Science 2012 (name-matched, not ORCID-linked)
- An Integer Optimization Approach to Large-Scale Air Traffic Flow Management — Operations Research 2011
- Performance Analysis of Queueing Networks via Robust Optimization — Operations Research 2011
- Optimal Selection of Airport Runway Configurations — Operations Research 2011
- The Price of Fairness — Operations Research 2011
- Nonconvex Robust Optimization for Problems with Constraints — INFORMS Journal on Computing 2010
- Robust Optimization for Unconstrained Simulation-Based Problems — Operations Research 2010
- Constructing Uncertainty Sets for Robust Linear Optimization — Operations Research 2009
- Algorithmic Prediction of Health-Care Costs — Operations Research 2008
- A Learning Approach for Interactive Marketing to a Customer Segment — Operations Research 2007
- A Robust Optimization Approach to Inventory Theory — Operations Research 2006
- Simulation-Based Booking Limits for Airline Revenue Management — Operations Research 2005
- The Price of Robustness — Operations Research 2004
- Restaurant Revenue Management — Operations Research 2003
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective — Operations Research 2003
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems — Management Science 2002
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach — Operations Research 2002
- Multistage Lot Sizing Problems via Randomized Rounding — Operations Research 2001
- Hedging Derivative Securities and Incomplete Markets: An ε-Arbitrage Approach — Operations Research 2001
- Probabilistic Service Level Guarantees in Make-to-Stock Manufacturing Systems — Operations Research 2001
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic — Operations Research 2000
- When is time continuous? — Journal of Financial Economics 2000
- A New Algebraic Geometry Algorithm for Integer Programming — Management Science 2000
- Bounds and Policies for Dynamic Routing in Loss Networks — Operations Research 1999
- The Air Traffic Flow Management Problem with Enroute Capacities — Operations Research 1998
- From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems — Operations Research 1998
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty — Operations Research 1996
- The Distributional Little's Law and Its Applications — Operations Research 1995
- Models and Algorithms for Transient Queueing Congestion at Airports — Management Science 1995
- Decomposition Algorithms for Analyzing Transient Phenomena in Multiclass Queueing Networks in Air Transportation — Operations Research 1995
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience — Operations Research 1995
- The Multi-Airport Ground-Holding Problem in Air Traffic Control — Operations Research 1994
The interactive profile shows the complete publication list.