Preference Order Stochastic Knapsack Problems: Methodological Issues

DOI10.2307/2581283zbMath0457.90059OpenAlexW4234344924MaRDI QIDQ3907413

Moshe Sniedovich

Publication date: 1980

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581283

zbMATH Keywords

preference order dynamic programmingpreference order stochastic knapsack problems

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (12)

Experiments with dynamic programming algorithms for nonseparable problems ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ The Risk-Averse Static Stochastic Knapsack Problem ⋮ Stochastic models for budget optimization in search-based advertising ⋮ Adaptivity in the stochastic blackjack knapsack problem ⋮ STATIC STOCHASTIC KNAPSACK PROBLEMS ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ The static stochastic knapsack problem with normally distributed item sizes ⋮ A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Mean, variance and probabilistic criteria in finite Markov decision processes: A review

This page was built for publication: Preference Order Stochastic Knapsack Problems: Methodological Issues