The following pages link to Retsef Levi (Q304236):
Displaying 41 items.
- The submodular joint replenishment problem (Q304238) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- NP-hardness proof for the assembly problem with stationary setup and additive holding costs (Q1949675) (← links)
- Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
- The Data-Driven Newsvendor Problem: New Bounds and Insights (Q2797452) (← links)
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand (Q2806071) (← links)
- Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times (Q2846418) (← links)
- Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator (Q2879489) (← links)
- (Q2921691) (← links)
- Provably near-optimal sampling-based algorithms for Stochastic inventory control models (Q2931434) (← links)
- Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models (Q2976153) (← links)
- Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources (Q3100484) (← links)
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem (Q3117702) (← links)
- A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales (Q3168971) (← links)
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities (Q3168976) (← links)
- Approximation Algorithms for Capacitated Stochastic Inventory Control Models (Q3392240) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- (Q3579387) (← links)
- Primal-dual algorithms for deterministic inventory problems (Q3581001) (← links)
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem (Q3595394) (← links)
- Approximation Algorithms for Stochastic Inventory Control Models (Q3596339) (← links)
- Inventory and Facility Location Models with Market Selection (Q3596348) (← links)
- Approximation algorithms for capacitated stochastic inventory systems with setup costs (Q4632839) (← links)
- Maintenance scheduling for modular systems: Modeling and algorithms (Q4632854) (← links)
- Maintenance and flight scheduling of low observable aircraft (Q4632883) (← links)
- Technical Note—A Sampling-Based Approach to Appointment Scheduling (Q4648263) (← links)
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs (Q4962739) (← links)
- Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (Q4971565) (← links)
- Near-Optimality of Uniform Copayments for Subsidies and Taxes Allocation Problems (Q5126620) (← links)
- The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms (Q5166263) (← links)
- Approximation Algorithms for Dynamic Assortment Optimization Models (Q5219727) (← links)
- Primal-Dual Algorithms for Deterministic Inventory Problems (Q5387979) (← links)
- Approximation Algorithms for Stochastic Inventory Control Models (Q5388030) (← links)
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models (Q5388063) (← links)
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (Q5429286) (← links)
- (Q5501373) (← links)
- Integer Programming and Combinatorial Optimization (Q5712454) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)
