The Dynamic and Stochastic Knapsack Problem with Deadlines

DOI10.1287/MNSC.42.12.1706MaRDI QIDQ4361489zbMATH OpenOpenAlexFDO

Authors Jason D. Papastavrou, Srikanth Rajagopalan, Anton J. Kleywegt

Publication date 28 October 1997

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e9c8b0aaade2bb1fea3040ec8fdfe056d3121d04

zbMATH Keywords

knapsack problemstochastic modeloptimal policyfixed time horizon

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40)

Recommendations

• The dynamic and stochastic knapsack problem
• The stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• Static stochastic Knapsack problems
• An adaptive stochastic knapsack problem

Cited in

(52)

• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
• The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• Markov decision problems where means bound variances
• The stochastic knapsack problem
• Optimality of randomized trunk reservation for a problem with a single constraint
• Revenue maximization in the dynamic knapsack problem
• A single-resource allocation problem with Poisson resource requirements
• The Risk-Averse Static Stochastic Knapsack Problem
• Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
• A revenue management model for products with two capacity dimensions
• Order acceptance in food processing systems with random raw material requirements
• The online knapsack problem with incremental capacity
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
• Online contention resolution schemes for size-stochastic knapsacks
• Revenue management in make-to-order manufacturing-an application to the iron and steel industry
• Approximations to stochastic dynamic programs via information relaxation duality
• An adaptive stochastic knapsack problem
• Adaptive Bin Packing with Overflow
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• Improving LTL truck load utilization on line
• The static stochastic knapsack problem with normally distributed item sizes
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
• Queue-constrained packing: a vehicle ferry case study
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Approximating the solution of a dynamic, stochastic multiple knapsack problem
• Exact algorithms for the 0-1 time-bomb knapsack problem
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Static stochastic Knapsack problems
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• scientific article; zbMATH DE number 2084697 (Why is no real title available?)
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
• Approximating the Value Functions of Stochastic Knapsack Problems: A Homogeneous Monge-Amp\'ere Equation and Its Stochastic Counterparts
• The adaptive Knapsack problem with stochastic rewards
• Online generalized assignment problem with historical information
• Heuristic policies for stochastic knapsack problem with time-varying random demand
• The secretary problem with multiple job vacancies and batch candidate arrivals
• Quickest online selection of an increasing subsequence of specified size
• An optimal double stopping rule for a buying-selling problem
• The dynamic and stochastic knapsack problem with homogeneous-sized items and postponement options
• The dynamic and stochastic knapsack problem
• Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
• A stochastic knapsack game: revenue management in competitions
• Dynamic nonlinear pricing of inventories over finite sales horizons
• Managing uncertainty in orthopaedic trauma theatres.
• Adaptivity in the stochastic blackjack knapsack problem
• Optimal project selection: Stochastic knapsack with finite time horizon
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes

This page was built for publication: The Dynamic and Stochastic Knapsack Problem with Deadlines

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