Pages that link to "Item:Q3634979"

The following pages link to The Dynamic and Stochastic Knapsack Problem with Random Sized Items (Q3634979):

Displaying 50 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• An adaptive stochastic knapsack problem (Q297367) (← links)
• Lending decisions with limits on capital available: the polygamous marriage problem (Q320958) (← links)
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
• On two-stage stochastic knapsack problems (Q643023) (← links)
• Order acceptance in food processing systems with random raw material requirements (Q708877) (← links)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
• A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
• O\&D revenue management in cargo airlines-a mathematical programming approach (Q858605) (← 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)
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
• An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition (Q1038300) (← links)
• Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
• Production planning with order acceptance and demand uncertainty (Q1652551) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A two-stage bid-price control for make-to-order revenue management (Q1762076) (← links)
• Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
• Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues (Q1991289) (← links)
• The secretary problem with multiple job vacancies and batch candidate arrivals (Q2060597) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← 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)
• Narrowing the search for optimal call-admission policies via a nonlinear stochastic knapsack model (Q2342132) (← links)
• Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
• Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline (Q2459400) (← links)
• Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
• A continuous-time seat control model for single-leg flights with no-shows and optimal overbooking upper bound (Q2503095) (← links)
• The dynamic and stochastic knapsack problem (Q2770073) (← links)
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
• Quantity Premiums and Discounts in Dynamic Pricing (Q2931704) (← links)
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585) (← links)
• A stochastic linear knapsack problem (Q3799817) (← links)
• The Dynamic and Stochastic Knapsack Problem with Deadlines (Q4361489) (← links)
• Heuristic policies for stochastic knapsack problem with time‐varying random demand (Q4627119) (← links)
• The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options (Q4632884) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• The Risk-Averse Static Stochastic Knapsack Problem (Q5085467) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• (Q5129172) (← links)
• Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons (Q5130498) (← links)
• Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
• (Q5305223) (← links)
• STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)
• Distributionally robust scheduling of stochastic knapsack arrivals (Q6568455) (← links)