400 search results - page 15 / 80 » Extended formulations in combinatorial optimization |
115
click to vote
FOCM
2010
14 years 10 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
106
click to vote
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
This paper extends recent results in the GP schema theory by formulating a proper exact schema theorem for GP with one-point crossover. This gives an exact expression for the expe...