Sciweavers

55 search results - page 6 / 11
» orl 2008
Sort
View
ORL
2008
93views more  ORL 2008»
15 years 4 months ago
Polymatroids and mean-risk minimization in discrete optimization
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
Alper Atamtürk, Vishnu Narayanan
ORL
2008
77views more  ORL 2008»
15 years 4 months ago
A risk-averse newsvendor with law invariant coherent measures of risk
For general law invariant coherent measures of risk, we derive an equivalent representation of a risk-averse newsvendor problem as a meanrisk model. We prove that the higher the w...
Sungyong Choi, Andrzej Ruszczynski
ORL
2008
66views more  ORL 2008»
15 years 4 months ago
Profit-based latency problems on the line
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
Sofie Coene, Frits C. R. Spieksma
ORL
2008
160views more  ORL 2008»
15 years 4 months ago
Efficient nested pricing in the simplex algorithm
We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and ...
Ping-Qi Pan
ORL
2008
60views more  ORL 2008»
15 years 4 months ago
Lot-sizing on a tree
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also sh...
Marco Di Summa, Laurence A. Wolsey