A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
From MaRDI portal
Publication:989843
DOI10.1007/s10589-008-9197-2zbMath1200.90132MaRDI QIDQ989843
Jorge Pinho de Sousa, João Claro
Publication date: 23 August 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9197-2
90C15: Stochastic programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
The Risk-Averse Static Stochastic Knapsack Problem, Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure, On two-stage stochastic knapsack problems, Recent trends in metaheuristics for stochastic combinatorial optimization, Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm, Integrated demand and procurement portfolio management with spot market volatility and option contracts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios
- Some comments on preference order dynamic programming models
- Tabu search when noise is present: An illustration in the context of cause and effect analysis
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Stochastic programming with integer variables
- Multiple criteria decision making combined with finance: a categorized bibliographic study.
- Simulated annealing for complex portfolio selection problems.
- On robust optimization of two-stage systems
- An MCDM approach to portfolio optimization.
- The multidimensional 0-1 knapsack problem: an overview.
- An interactive heuristic method for multi-objective combinatorial optimization
- Heuristics for cardinality constrained portfolio optimization
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
- Deviation measures in linear two-stage stochastic programming
- On deviation measures in stochastic integer programming
- Convexity and decomposition of mean-risk stochastic programs
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Coherent Measures of Risk
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization
- A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Preference Order Stochastic Knapsack Problems: Methodological Issues
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- On a Class of Minimax Stochastic Programs
- Binary knapsack problems with random budgets
- Dual Stochastic Dominance and Related Mean-Risk Models
- Polyhedral Risk Measures in Stochastic Programming
- Optimization of Convex Risk Functions
- Stochastic Algorithms: Foundations and Applications
- Selecting portfolios with fixed costs and minimum transaction lots
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- Simulation-based optimization using simulated annealing with ranking and selection
