427 search results - page 54 / 86 » A Subexponential Bound for Linear Programming |
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
4OR
2006
13 years 9 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
EOR
2007
13 years 8 months ago
2007
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
MP
2006
13 years 8 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...