The following pages link to The stochastic knapsack problem (Q3830820):
Displaying 25 items.
- An adaptive stochastic knapsack problem (Q297367) (← links)
- Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking (Q342261) (← links)
- The stochastic generalized bin packing problem (Q423955) (← links)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
- On two-stage stochastic knapsack problems (Q643023) (← links)
- A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
- A critically loaded multiclass Erlang loss system (Q803668) (← 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)
- Optimal access control for broadband services: Stochastic knapsack with advance information (Q1266657) (← links)
- The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem (Q1280190) (← links)
- Optimization via trunk reservation in single resource loss systems under heavy traffic (Q1379722) (← links)
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling (Q1761167) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
- Exponential penalty function control of loss networks (Q1769408) (← links)
- Optimal patient and personnel scheduling policies for care-at-home service facilities (Q1926675) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Optimal road maintenance investment in traffic networks with random demands (Q2037903) (← links)
- An optimal stopping policy for car rental businesses with purchasing customers (Q2095189) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- Narrowing the search for optimal call-admission policies via a nonlinear stochastic knapsack model (Q2342132) (← links)
- Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585) (← links)
- (Q5053286) (← links)
- STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
