5331 search results - page 196 / 1067 » Algebraic Methods for Optimization Problems |
172
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
266
click to vote
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
248
click to vote
PROCEDIA
2011
14 years 9 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
140
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
162
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
This work focuses on the development of a parallel framework method to improve the effectiveness and the efficiency of the obtained solutions by Multi-objective Evolutionary Algori...