Sciweavers

377 search results - page 55 / 76
» Discrete stochastic optimization using linear interpolation
Sort
View
IOR
2010
72views more  IOR 2010»
13 years 6 months ago
Inventory Control with Generalized Expediting
We consider a single-item, periodic review inventory control problem where discrete stochastic demand must be satisfied. When shortages occur, the unmet demand must be filled by...
Eric Logan Huggins, Tava Lennon Olsen
CCE
2005
13 years 7 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
SARA
2009
Springer
14 years 2 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
GMP
2010
IEEE
175views Solid Modeling» more  GMP 2010»
13 years 12 months ago
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
Gang Xu, Bernard Mourrain, Régis Duvigneau,...
CVPR
2012
IEEE
11 years 10 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys