5331 search results - page 140 / 1067 » Algebraic Methods for Optimization Problems |
196
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
100
click to vote
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
109
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
NHM
2010
14 years 4 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...