Sciweavers

2636 search results - page 254 / 528
» Linear Programming
Sort
View
SIAMJO
2002
120views more  SIAMJO 2002»
15 years 2 months ago
Dual Stochastic Dominance and Related Mean-Risk Models
We consider the problem of constructing mean{risk models which are consistent with the second degree stochastic dominance relation. By exploiting duality relations of convex analys...
Wlodzimierz Ogryczak, Andrzej Ruszczynski
JAIR
2010
99views more  JAIR 2010»
15 years 1 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
TRANSCI
2010
101views more  TRANSCI 2010»
15 years 1 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu
CDC
2009
IEEE
141views Control Systems» more  CDC 2009»
15 years 26 days ago
Cell design in bacteria as a convex optimization problem
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
Anne Goelzer, Vincent Fromion, Gérard Scorl...
CPAIOR
2011
Springer
14 years 6 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...