Pages that link to "Item:Q4031999"
From MaRDI portal
The following pages link to An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns (Q4031999):
Displaying 19 items.
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- On two-stage stochastic knapsack problems (Q643023) (← links)
- The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
- A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← 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)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← 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)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
