David Simchi-Levi

According to our database1, David Simchi-Levi authored at least 118 papers between 1986 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


From the Editor: Diversity, Equity, and Inclusion in <i>Management Science</i>.
Manag. Sci., 2020

Near-Optimal Regret Bounds for Model-Free RL in Non-Stationary Episodic MDPs.
CoRR, 2020

Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective.
CoRR, 2020

Privacy-Preserving Dynamic Personalized Pricing with Demand Learning.
CoRR, 2020

Provably More Efficient Q-Learning in the Full-Feedback/One-Sided-Feedback Settings.
CoRR, 2020

Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism.
CoRR, 2020

Online Learning and Optimization for Revenue Management Problems with Add-on Discounts.
CoRR, 2020

Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability.
CoRR, 2020

Distributionally Robust Max Flows.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models.
Math. Oper. Res., 2019

From the Editor.
Manag. Sci., 2019

Dynamic Learning and Pricing with Model Misspecification.
Manag. Sci., 2019

Drivers of Product Expiration in Consumer Packaged Goods Retailing.
Manag. Sci., 2019

Designing Response Supply Chain Against Bioattacks.
Oper. Res., 2019

Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited.
Oper. Res., 2019

Network Revenue Management with Limited Switches: Known and Unknown Demand Distributions.
CoRR, 2019

Online Pricing with Offline Data: Phase Transition and Inverse Square Law.
CoRR, 2019

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints.
CoRR, 2019

A Competitive Analysis of Online Knapsack Problems with Unit Density.
CoRR, 2019

Reinforcement Learning under Drift.
CoRR, 2019

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios.
CoRR, 2019

Conservative Exploration for Semi-Bandits with Linear Generalization: A Product Selection Problem for Urban Warehouses.
CoRR, 2019

Hedging the Drift: Learning to Optimize under Non-Stationarity.
CoRR, 2019

Meta Dynamic Pricing: Learning Across Experiments.
CoRR, 2019

Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Learning to Optimize under Non-Stationarity.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Reengineering <i>Management Science</i> for a Sharper Focus and Broader Appeal.
Manag. Sci., 2018

Online Network Revenue Management Using Thompson Sampling.
Oper. Res., 2018

Dynamic Pricing under a Static Calendar.
CoRR, 2018

On Policies for Single-leg Revenue Management with Limited Demand Information.
CoRR, 2018

Inventory Balancing with Online Learning.
CoRR, 2018

The Lingering of Gradients: How to Reuse Gradients Over Time.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Editorial Statement - Operations Management.
Manag. Sci., 2017

Technical Note - Dynamic Pricing and Demand Learning with Limited Price Experimentation.
Oper. Res., 2017

Assortment Optimization under Unknown MultiNomial Logit Choice Models.
CoRR, 2017

Uplift Modeling with Multiple Treatments and General Response Types.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

A Practically Competitive and Provably Consistent Algorithm for Uplift Modeling.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

Analyzing process flexibility: A distribution-free approach with partial expectations.
Oper. Res. Lett., 2016

Analytics for an Online Retailer: Demand Forecasting and Price Optimization.
Manuf. Serv. Oper. Manag., 2016

Worst-Case Analysis of Process Flexibility Designs.
Oper. Res., 2015

Identifying Risks and Mitigating Disruptions in the Automotive Supply Chain.
Interfaces, 2015

Reaping the Benefits of Bundling under High Production Costs.
CoRR, 2015

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.
SIAM J. Discret. Math., 2014

OM Forum - OM Research: From Problem-Driven to Data-Driven Research.
Manuf. Serv. Oper. Manag., 2014

Analyzing Scrip Systems.
Oper. Res., 2014

A Game-Theoretic Model of International Influenza Vaccination Coordination.
Manag. Sci., 2013

Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility.
Oper. Res., 2012

Optimal Market-Making with Risk Aversion.
Oper. Res., 2012

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle.
Oper. Res., 2012

Optimal static pricing for a tree network.
Ann. Oper. Res., 2012

Performance Evaluation of Stochastic Multi-Echelon Inventory Systems: A Survey.
Adv. Oper. Res., 2012

Stock repurchase with an adaptive reservation price: A study of the greedy policy.
Oper. Res. Lett., 2011

Introduction to "Little's Law as Viewed on Its 50th Anniversary".
Oper. Res., 2011

From the Editor: Reflections on the Last Six Years.
Oper. Res., 2011

Sourcing Flexibility, Spot Trading, and Procurement Contract Structure.
Oper. Res., 2011

Multiship Crane Sequencing with Yard Congestion Constraints.
Transp. Sci., 2010

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks.
Oper. Res. Lett., 2009

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand.
Math. Oper. Res., 2009

Competition in the Supply Option Market.
Oper. Res., 2009

Policies utilizing tactical inventory for service-differentiated customers.
Oper. Res. Lett., 2008

Supply Chain Coordination and Influenza Vaccination.
Oper. Res., 2008

Risk Aversion in Inventory Management.
Oper. Res., 2007

Inventory placement in acyclic supply chain networks.
Oper. Res. Lett., 2006

Coordinating inventory control and pricing strategies: The continuous review model.
Oper. Res. Lett., 2006

Pricing, Production, and Inventory Policies for Manufacturing with Stochastic Demand and Discretionary Sales.
Manuf. Serv. Oper. Manag., 2006

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates.
Math. Program., 2006

Performance Analysis and Evaluation of Assemble-to-Order Systems with Stochastic Sequential Lead Times.
Oper. Res., 2006

On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions.
Oper. Res., 2006

Dispatching vehicles in a mega container terminal.
OR Spectr., 2005

Safety Stock Positioning in Supply Chains with Stochastic Lead Times.
Manuf. Serv. Oper. Manag., 2005

Dynamic Pricing and the Direct-to-Customer Model in the Automotive Industry.
Electron. Commer. Res., 2005

A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals.
Queueing Syst. Theory Appl., 2004

Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case.
Math. Oper. Res., 2004

Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case.
Oper. Res., 2004

Networks and Flows.
Proceedings of the Handbook of Graph Theory., 2003

Supply Chain Design and Planning - Applications of Optimization Techniques for Strategic and Tactical Models.
Proceedings of the Supply Chain Management: Design, Coordination and Operation, 2003

The Value of Information Sharing in a Two-Stage Supply Chain with Production Capacity Constraints: The Infinite Horizon Case.
Manuf. Serv. Oper. Manag., 2002

Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures.
Manag. Sci., 2002

On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures.
Oper. Res., 2002

Uniform distribution of inventory positions in two-echelon periodic review systems with batch-ordering policies and interdependent demands.
Eur. J. Oper. Res., 2002

Set-Covering-Based Algorithms for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates.
Oper. Res. Lett., 2001

The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem.
Oper. Res., 2001

Networks And Flows.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Discrete Optimization.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Worst-case analyses, linear programming and the bin-packing problem.
Math. Program., 1998

Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem.
Oper. Res., 1998

Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics.
Oper. Res., 1998

Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models.
Oper. Res., 1998

On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.
Oper. Res., 1997

Single Resource Multi-Item Inventory Systems.
Oper. Res., 1996

Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows.
Oper. Res., 1996

A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty.
Oper. Res., 1996

Routing in a linear lightwave network.
IEEE/ACM Trans. Netw., 1995

A Location Based Heuristic for General Routing Problems.
Oper. Res., 1995

Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.
Oper. Res., 1994

A note on the prize collecting traveling salesman problem.
Math. Program., 1993

A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.
Math. Oper. Res., 1993

On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems.
Oper. Res. Lett., 1992

The complexity of the staggering problem, and other classical inventory problems.
Oper. Res. Lett., 1992

Finding disjoint paths with different path-costs: Complexity and algorithms.
Networks, 1992

On the Distance Constrained Vehicle Routing Problem.
Oper. Res., 1992

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.
Oper. Res., 1992

The point-to-point delivery and connection problems: complexity and algorithms.
Discret. Appl. Math., 1992

Light traffic heuristic for an<i>M/G</i>/1 queue with limited inventory.
Ann. Oper. Res., 1992

Analysis of heuristics for the design of tree networks.
Ann. Oper. Res., 1992

Asymptotic behavior of the Weber location problem on the plane.
Ann. Oper. Res., 1992

The Capacitated Traveling Salesman Location Problem.
Transp. Sci., 1991

Technical Note - Conditional Location Problems on Networks.
Transp. Sci., 1990

Optimal locations and districts of two traveling salesmen on a tree.
Networks, 1990

Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems.
INFORMS J. Comput., 1990

The complexity of finding two disjoint paths with min-max objective function.
Discret. Appl. Math., 1990

The Traveling Salesman Location Problem on Stochastic Networks.
Transp. Sci., 1989

Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.
Transp. Sci., 1988

The minimax multistop location problem on a tree.
Networks, 1988

A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks.
Oper. Res., 1988

Minisum location of a traveling salesman.
Networks, 1986