14739 search results - page 241 / 2948 » An optimization problem on the sphere |
151
click to vote
IPPS
2005
IEEE
16 years 6 days ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
153
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
168
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
196
Voted
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The bootstrap problem is often recognized as one of the main challenges of evolutionary robotics: if all individuals from the first randomly generated population perform equal...
169
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...