Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Stochastic knapsack"”.
-
Dynamic-programming approaches to single-and multi-stage stochastic knapsack problems for portfolio optimization
… certain single-stage and multi-stage integer stochastic knapsack problems. These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type. Given an initial …
-
Knapsack Problems; Methods, Models and Applications
Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …
-
Knapsack Problems; Methods, Models and Applications
Knapsack problem (KP) has broad applications in different fields such as machine scheduling, space allocation, and asset optimization. Meanwhile, it is a hard problem due to its computational complexity, but numerous solution approaches have been developed for a variety of KP. In this dissertation, …
-
Optimal and Near-optimal Policies of Sequential Decision Problems under Uncertainty
<p>In this dissertation, we study stochastic sequential decision problems with a discrete finite time horizon. We conduct substantial analyses on both optimal and near-optimal policies of such problems, and focus on the total reward collected by different sequential policies from different …
-
Data-driven Optimization of Dynamic Resource Allocation in Transport and Logistics
… explores data-driven optimization approaches for stochastic and dynamic resource allocation in transport and logistics. The introduction of uncertainty is explored from both demand and supply perspectives in the context of online optimization problems where problem data is revealed over time. The …
-
Decision making under uncertainty
… continuous. The second problem concerns with the stochastic versions of a broad class of combinatorial optimization problems. We observe that the expected value is inadequate in capturing different types of risk-averse or risk-prone behaviors, and instead we consider a more general objective which …
-
Relaxations for the dynamic knapsack problem with stochastic item sizes
We consider a version of the knapsack problem in which an item size is random and revealed only when the decision maker attempts to insert it. After every successful insertion the decision maker can choose the next item dynamically based on the remaining capacity and available items, while an …