Skip to main navigation
Skip to search
Skip to main content
Tilburg University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Tilburg University Research Portal
Home
Profiles
Research output
Research units
Activities
Projects
Press/Media
Prizes
Datasets
The risk-averse static stochastic knapsack problem
Yasemin Merzifonluoglu
, Joseph Geunes
Econometrics and OR
Research Group: Operations Research
Research output
:
Contribution to journal
›
Article
›
Scientific
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The risk-averse static stochastic knapsack problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Risk-averse
100%
Risk Measures
100%
Stochastic Knapsack
100%
Modeling Approach
50%
At-risk
50%
Mean Standard Deviation
50%
Conditional Value
50%
Popular
25%
High Performance
25%
Selection Strategy
25%
Resource Allocation Problem
25%
Expected Cost
25%
Expected Profit
25%
Risk-neutral
25%
Rank Order
25%
Scenario Approach
25%
Optimality Properties
25%
Solution Method
25%
Risk Level
25%
Optimality Conditions
25%
Multiple Items
25%
Resource Requirements
25%
Penalty Function
25%
Asymptotically Optimal
25%
Approximate Solution
25%
Item Selection
25%
Discrete Distribution
25%
Exact Solutions
25%
Expected Risk
25%
Value-based Approach
25%
Resource Needs
25%
Mixed Integer Linear Programming Model
25%
General Distribution
25%
Computational Challenges
25%
Heuristic Method
25%
Sample Average Approximation
25%
Continuous Relaxation
25%
Knapsack
25%
Problem Class
25%
Excess Weight
25%
Mixed-integer Nonlinear Optimization
25%
Resource Consumption
25%
Penalty Value
25%
Optimization Modeling
25%
Weight Penalty
25%
Ordering Mechanism
25%
Consumption Values
25%
High Loss
25%
Distributed Resources
25%
Capacity Value
25%
Modelling Challenges
25%
Computer Science
Knapsack Problem
100%
Value at Risk
66%
Approximation (Algorithm)
33%
Allocation Problem
33%
Single Resource
33%
Optimality Condition
33%
Resource Requirement
33%
Penalty Function
33%
Solution Method
33%
Knapsack
33%
Programming Model
33%
Selection Strategy
33%
Mixed-Integer Linear Programming
33%
Heuristic Method
33%
Approximate Solution
33%
Distributed Resource
33%
Resource Consumption
33%
Resource Allocation
33%
Mathematics
Stochastics
100%
Risk Measure
100%
Integer
50%
Optimality
50%
Modeling Approach
50%
Standard Deviation
50%
Conditional Value At Risk
50%
Approximation Method
25%
Discrete Distribution
25%
Numerical Analysis
25%
Approximate Solution
25%
Sample Average
25%
Excess Risk
25%
Linear Programming
25%
Heuristic Method
25%
Economics, Econometrics and Finance
Combinatorial Optimization
100%
Measure of Dispersion
66%