Pages that link to "Item:Q4361489"

The following pages link to The Dynamic and Stochastic Knapsack Problem with Deadlines (Q4361489):

Displaying 35 items.

• The online knapsack problem with incremental capacity (Q283993) (← links)
• Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
• Improving LTL truck load utilization on line (Q531465) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Order acceptance in food processing systems with random raw material requirements (Q708877) (← links)
• The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
• A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
• Revenue management in make-to-order manufacturing-an application to the iron and steel industry (Q858612) (← links)
• A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
• A revenue management model for products with two capacity dimensions (Q976461) (← links)
• Managing uncertainty in orthopaedic trauma theatres. (Q1420444) (← links)
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• The secretary problem with multiple job vacancies and batch candidate arrivals (Q2060597) (← links)
• Online generalized assignment problem with historical information (Q2108140) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• An optimal double stopping rule for a buying-selling problem (Q2176381) (← links)
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing (Q2183325) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature (Q2445842) (← links)
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
• Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
• Markov Decision Problems Where Means Bound Variances (Q2931706) (← links)
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585) (← links)
• Heuristic policies for stochastic knapsack problem with time‐varying random demand (Q4627119) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• A Stochastic Knapsack Game: Revenue Management in Competitions (Q5005324) (← links)
• The Risk-Averse Static Stochastic Knapsack Problem (Q5085467) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
• Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons (Q5130498) (← links)
• Optimality of randomized trunk reservation for a problem with a single constraint (Q5475396) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)