Sciweavers

270 search results - page 4 / 54
» Constraint relaxation in approximate linear programs
Sort
View
ICCV
2009
IEEE
15 years 10 days ago
Curvature Regularity for Region-based Image Segmentation and Inpainting: A Linear Programming Relaxation
We consider a class of region-based energies for image segmentation and inpainting which combine region integrals with curvature regularity of the region boundary. To minimize s...
Thomas Schoenemann, Fredrik Kahl, Daniel Cremers
CPAIOR
2006
Springer
13 years 11 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
EOR
2011
134views more  EOR 2011»
13 years 2 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
SIAMJO
2010
112views more  SIAMJO 2010»
13 years 2 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang