| Publication | Date of Publication | Type |
|---|
The approximability of assortment optimization under ranking preferences
Operations Research | 2020-11-08 | Paper |
Near-optimality of uniform copayments for subsidies and taxes allocation problems
Operations Research | 2020-10-20 | Paper |
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Operations Research | 2020-10-12 | Paper |
Approximation algorithms for dynamic assortment optimization models
Mathematics of Operations Research | 2020-03-12 | Paper |
Maintenance scheduling for modular systems: modeling and algorithms
Naval Research Logistics | 2019-05-02 | Paper |
Approximation algorithms for capacitated stochastic inventory systems with setup costs
Naval Research Logistics | 2019-05-02 | Paper |
Maintenance and flight scheduling of low observable aircraft
Naval Research Logistics | 2019-05-02 | Paper |
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
Operations Research Letters | 2018-09-28 | Paper |
Provably near-optimal balancing policies for multi-echelon stochastic inventory control models
Mathematics of Operations Research | 2017-04-13 | Paper |
The submodular joint replenishment problem
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
Supply chain management with online customer selection
Operations Research | 2016-07-25 | Paper |
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Operations Research | 2016-05-13 | Paper |
The data-driven newsvendor problem: new bounds and insights
Operations Research | 2016-04-05 | Paper |
From cost sharing mechanisms to online selection problems
Mathematics of Operations Research | 2015-11-04 | Paper |
Facility location with service installation costs
| 2015-08-03 | Paper |
Dynamic Allocation Problems in Loss Network Systems with Advanced Reservation
| 2015-05-14 | Paper |
Provably near-optimal sampling-based algorithms for stochastic inventory control models
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A constant approximation algorithm for the one-warehouse multi-retailer problem
| 2014-10-13 | Paper |
Efficient formulations for pricing under attraction demand models
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Online make-to-order joint replenishment model: primal-dual competitive algorithms
Operations Research | 2014-06-26 | Paper |
Approximation algorithms for the stochastic lot-sizing problem with order lead times
Operations Research | 2013-09-05 | Paper |
NP-hardness proof for the assembly problem with stationary setup and additive holding costs
Operations Research Letters | 2013-05-14 | Paper |
Technical Note—A Sampling-Based Approach to Appointment Scheduling
Operations Research | 2012-11-08 | Paper |
Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator
Operations Research | 2012-03-26 | Paper |
A constant approximation algorithm for the one-warehouse multiretailer problem
Management Science | 2012-02-29 | Paper |
LP-based approximation algorithms for capacitated facility location
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Provably near-optimal LP-based policies for revenue management in systems with reusable resources
Operations Research | 2011-11-24 | Paper |
Approximation algorithms for supply chain planning and logistics problems with market choice
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
Mathematics of Operations Research | 2011-04-27 | Paper |
A 2-approximation algorithm for stochastic inventory control models with lost sales
Mathematics of Operations Research | 2011-04-27 | Paper |
Primal-dual algorithms for deterministic inventory problems
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
scientific article; zbMATH DE number 5764798 (Why is no real title available?)
| 2010-08-06 | Paper |
Approximation Algorithms for Capacitated Stochastic Inventory Control Models
Operations Research | 2009-08-13 | Paper |
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
Mathematics of Operations Research | 2008-05-27 | Paper |
Approximation Algorithms for Stochastic Inventory Control Models
Mathematics of Operations Research | 2008-05-27 | Paper |
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Approximation Algorithms for Stochastic Inventory Control Models
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Inventory and Facility Location Models with Market Selection
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
