400 search results - page 14 / 80 » Extended formulations in combinatorial optimization |
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
NIPS
2008
15 years 1 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
NETWORKS
2008
14 years 11 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...