David SimchiLevi
According to our database^{1},
David SimchiLevi
authored at least 118 papers
between 1986 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2020
Manag. Sci., 2020
CoRR, 2020
InstanceDependent Complexity of Contextual Bandits and Reinforcement Learning: A DisagreementBased Perspective.
CoRR, 2020
CoRR, 2020
Provably More Efficient QLearning in the FullFeedback/OneSidedFeedback Settings.
CoRR, 2020
Reinforcement Learning for NonStationary Markov Decision Processes: The Blessing of (More) Optimism.
CoRR, 2020
Online Learning and Optimization for Revenue Management Problems with Addon Discounts.
CoRR, 2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability.
CoRR, 2020
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
2019
SamplingBased Approximation Schemes for Capacitated Stochastic Inventory Control Models.
Math. Oper. Res., 2019
Manag. Sci., 2019
Manag. Sci., 2019
Manag. Sci., 2019
Oper. Res., 2019
Oper. Res., 2019
Network Revenue Management with Limited Switches: Known and Unknown Demand Distributions.
CoRR, 2019
CoRR, 2019
Multistage and Multicustomer Assortment Optimization with Inventory Constraints.
CoRR, 2019
CoRR, 2019
CoRR, 2019
Algorithms for Online Matching, Assortment, and Pricing with Tight Weightdependent Competitive Ratios.
CoRR, 2019
Conservative Exploration for SemiBandits with Linear Generalization: A Product Selection Problem for Urban Warehouses.
CoRR, 2019
CoRR, 2019
CoRR, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Tight Weightdependent Competitive Ratios for Online Edgeweighted Bipartite Matching and Beyond.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019
2018
Manag. Sci., 2018
Oper. Res., 2018
CoRR, 2018
CoRR, 2018
CoRR, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
2017
Manag. Sci., 2017
Technical Note  Dynamic Pricing and Demand Learning with Limited Price Experimentation.
Oper. Res., 2017
CoRR, 2017
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017
2016
Analyzing process flexibility: A distributionfree approach with partial expectations.
Oper. Res. Lett., 2016
Manuf. Serv. Oper. Manag., 2016
2015
Oper. Res., 2015
Interfaces, 2015
CoRR, 2015
2014
SIAM J. Discret. Math., 2014
Manuf. Serv. Oper. Manag., 2014
Oper. Res., 2014
2013
Manag. Sci., 2013
2012
Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility.
Oper. Res., 2012
Oper. Res., 2012
Approximating the Nonlinear Newsvendor and SingleItem Stochastic LotSizing Problems When Data Is Given by an Oracle.
Oper. Res., 2012
Ann. Oper. Res., 2012
Adv. Oper. Res., 2012
2011
Stock repurchase with an adaptive reservation price: A study of the greedy policy.
Oper. Res. Lett., 2011
Oper. Res., 2011
Oper. Res., 2011
Oper. Res., 2011
2010
Transp. Sci., 2010
2009
Fully polynomialtime approximation schemes for timecost tradeoff problems in seriesparallel project networks.
Oper. Res. Lett., 2009
A Fully PolynomialTime Approximation Scheme for SingleItem Stochastic Inventory Control with Discrete Demand.
Math. Oper. Res., 2009
Oper. Res., 2009
2008
Oper. Res. Lett., 2008
Oper. Res., 2008
2007
Oper. Res., 2007
2006
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 online algorithm for uniform parallel machine scheduling with release dates.
Math. Program., 2006
Performance Analysis and Evaluation of AssembletoOrder Systems with Stochastic Sequential Lead Times.
Oper. Res., 2006
On the Asymptotic Optimality of a Simple OnLine Algorithm for the Stochastic SingleMachine Weighted Completion Time Problem and Its Extensions.
Oper. Res., 2006
2005
OR Spectr., 2005
Manuf. Serv. Oper. Manag., 2005
Electron. Commer. Res., 2005
2004
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
2003
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
2002
The Value of Information Sharing in a TwoStage Supply Chain with Production Capacity Constraints: The Infinite Horizon Case.
Manuf. Serv. Oper. Manag., 2002
Effective ZeroInventoryOrdering Policies for the SingleWarehouse Multiretailer Problem with Piecewise Linear Cost Structures.
Manag. Sci., 2002
On the Effectiveness of ZeroInventoryOrdering Policies for the Economic LotSizing Model with a Class of Piecewise Linear Cost Structures.
Oper. Res., 2002
Uniform distribution of inventory positions in twoechelon periodic review systems with batchordering policies and interdependent demands.
Eur. J. Oper. Res., 2002
Proceedings of the Vehicle Routing Problem., 2002
2001
Asymptotic analysis of an online 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
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
1998
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
Oper. Res., 1998
1997
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.
Oper. Res., 1997
1996
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
1995
IEEE/ACM Trans. Netw., 1995
Oper. Res., 1995
1994
WorstCase Analysis of Heuristics for the Bin Packing Problem with General Cost Structures.
Oper. Res., 1994
1993
Math. Program., 1993
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.
Math. Oper. Res., 1993
1992
On the minimumcardinalityboundeddiameter and the boundedcardinalityminimumdiameter edge addition problems.
Oper. Res. Lett., 1992
Oper. Res. Lett., 1992
Networks, 1992
Oper. Res., 1992
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.
Oper. Res., 1992
Discret. Appl. Math., 1992
Ann. Oper. Res., 1992
Ann. Oper. Res., 1992
Ann. Oper. Res., 1992
1991
Transp. Sci., 1991
1990
Transp. Sci., 1990
Networks, 1990
WorstCase Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems.
INFORMS J. Comput., 1990
Discret. Appl. Math., 1990
1989
Transp. Sci., 1989
1988
Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.
Transp. Sci., 1988
Networks, 1988
Oper. Res., 1988
1986
Networks, 1986