Stochastic Knapsack Revisited: The Service Level Perspective

DOI10.1287/opre.2021.2173zbMath1493.91064OpenAlexW3215369541MaRDI QIDQ5080638

Guodong Lyu, Zhichao Zheng, Chung-Piaw Teo, Mabel C. Chou, Yuan-Guang Zhong

Publication date: 31 May 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2021.2173

zbMATH Keywords

resource allocationservice levelcapacity poolingstochastic knapsackoperations and supply chainspersistency value

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• An analog of the minimax theorem for vector payoffs
• Managing individual customer service constraints under stochastic demand
• Persistence in discrete optimization under data uncertainty
• The Dynamic and Stochastic Knapsack Problem
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
• TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Note: Optimal Policies for Serial Inventory Systems Under Fill Rate Constraints
• Persistency Model and Its Applications in Choice Modeling
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Computational Statistics
• Note—Effects of Centralization on Expected Costs in a Multi-Location Newsboy Problem
• Fast Approximation Algorithms for Knapsack Problems
• A Renewal Decision Problem
• Prediction, Learning, and Games
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits

This page was built for publication: Stochastic Knapsack Revisited: The Service Level Perspective