2109 search results - page 128 / 422 » Solving Necklace Constraint Problems |
143
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
152
click to vote
AIPS
1994
15 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
159
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
115
click to vote
DISOPT
2008
15 years 5 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
166
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...