The Dynamic and Stochastic Knapsack Problem with Deadlines
From MaRDI portal
Publication:4361489
DOI10.1287/mnsc.42.12.1706zbMath0886.90110OpenAlexW1963610003MaRDI QIDQ4361489
Anton J. Kleywegt, Jason D. Papastavrou, Srikanth Rajagopalan
Publication date: 28 October 1997
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e9c8b0aaade2bb1fea3040ec8fdfe056d3121d04
Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)
Related Items (35)
The online knapsack problem with incremental capacity ⋮ Exact algorithms for the 0-1 time-bomb knapsack problem ⋮ An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem ⋮ Revenue management in make-to-order manufacturing-an application to the iron and steel industry ⋮ Markov Decision Problems Where Means Bound Variances ⋮ The Risk-Averse Static Stochastic Knapsack Problem ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ An optimal double stopping rule for a buying-selling problem ⋮ A Stochastic Knapsack Game: Revenue Management in Competitions ⋮ Adaptivity in the stochastic blackjack knapsack problem ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Managing uncertainty in orthopaedic trauma theatres. ⋮ Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons ⋮ The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature ⋮ Heuristic policies for stochastic knapsack problem with time‐varying random demand ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ Improving LTL truck load utilization on line ⋮ A PTAS for the chance-constrained knapsack problem with random item sizes ⋮ A revenue management model for products with two capacity dimensions ⋮ Order acceptance in food processing systems with random raw material requirements ⋮ The static stochastic knapsack problem with normally distributed item sizes ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ A single-resource allocation problem with Poisson resource requirements ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Quickest online selection of an increasing subsequence of specified size ⋮ Optimality of randomized trunk reservation for a problem with a single constraint ⋮ The secretary problem with multiple job vacancies and batch candidate arrivals ⋮ Online generalized assignment problem with historical information ⋮ Adaptive Bin Packing with Overflow
This page was built for publication: The Dynamic and Stochastic Knapsack Problem with Deadlines
