Stochastic knapsack revisited: the service level perspective

DOI10.1287/OPRE.2021.2173MaRDI QIDQ5080638zbMATH OpenOpenAlexFDO

Authors Guodong Lyu, Mabel C. Chou, Chung-Piaw Teo, Zhichao Zheng, Yuanguang 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 allocationcapacity poolingstochastic knapsackservice leveloperations and supply chainspersistency value

Mathematics Subject Classification ID

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

Recommendations

• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Improved approximation results for stochastic knapsack problems
• Heuristic policies for stochastic knapsack problem with time-varying random demand
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic

Cites work

• A Renewal Decision Problem
• An analog of the minimax theorem for vector payoffs
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Computational Statistics
• Fast Approximation Algorithms for Knapsack Problems
• Managing individual customer service constraints under stochastic demand
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Note: Optimal policies for serial inventory systems under fill rate constraints
• Note—Effects of Centralization on Expected Costs in a Multi-Location Newsboy Problem
• Persistence in discrete optimization under data uncertainty
• Persistency model and its applications in choice modeling
• Prediction, Learning, and Games
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• The adaptive Knapsack problem with stochastic rewards
• The dynamic and stochastic knapsack problem

Cited in

(4)

• Information and memory in dynamic resource allocation
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Stochastic optimization for real time service capacity allocation under random service demand
• Online resource allocation under partially predictable demand

This page was built for publication: Stochastic knapsack revisited: the service level perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080638)