Pages that link to "Item:Q5495043"
From MaRDI portal
The following pages link to Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5495043):
Displaying 9 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Optimal halting policies in Markov population decision chains with constant risk posture (Q490217) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- Constant risk aversion in stochastic contests with exponential completion times (Q3120604) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
