Preference Order Stochastic Knapsack Problems: Methodological Issues

DOI10.2307/2581283zbMATH Open0457.90059OpenAlexW4234344924MaRDI QIDQ3907413FDOQ3907413

Authors: 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)

Cited In (12)

• Stochastic models for budget optimization in search-based advertising
• The Risk-Averse Static Stochastic Knapsack Problem
• 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
• Static stochastic Knapsack problems
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
• Mean, variance and probabilistic criteria in finite Markov decision processes: A review
• Experiments with dynamic programming algorithms for nonseparable problems
• Adaptivity in the stochastic blackjack knapsack problem
• Theory and applications of generalized dynamic programming: An overview
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907413)