Stochastic Combinatorial Optimization with Risk
We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding stochastic problems where the weight vector W has independent random compo...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/42837 |