1118 search results - page 115 / 224 » Convex Optimization |
MP
1998
13 years 9 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
MANSCI
2010
13 years 4 months ago
2010
This paper considers a manufacturer selling to a newsvendor retailer that possesses superior demand-forecast information. We show that the manufacturer's expected profit is c...
DAGM
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we address the problem of image sequence segmentation with dynamical shape priors. While existing formulations are typically based on hard decisions, we propose a fo...
IOR
2008
13 years 9 months ago
2008
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...