The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing

DOI10.1287/opre.1080.0555zbMath1167.90634arXiv0708.1146OpenAlexW2052799988MaRDI QIDQ3392221

David D. W. Yao, Grace Y. Lin, Yingdong Lu

Publication date: 13 August 2009

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

Full work available at URL: https://arxiv.org/abs/0708.1146

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (max. 100)

An adaptive stochastic knapsack problem ⋮ A Stochastic Knapsack Game: Revenue Management in Competitions ⋮ STATIC STOCHASTIC KNAPSACK PROBLEMS ⋮ Heuristic policies for stochastic knapsack problem with time‐varying random demand ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Component rationing for available-to-promise scheduling in configure-to-order systems ⋮ Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm ⋮ The secretary problem with multiple job vacancies and batch candidate arrivals ⋮ Unnamed Item ⋮ Joint client selection and contract design for a risk-averse commodity broker in a two-echelon supply chain

This page was built for publication: The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing