156 search results - page 5 / 32 » A cutting plane method for solving linear generalized disjun... |
ANOR
2005
13 years 7 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
SIAMJO
2011
13 years 2 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an eï¬...
EOR
2010
13 years 7 months ago
2010
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...