1054 search results - page 61 / 211 » Capacitated Domination Problem |
104
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
111
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
ISICA
2007
Springer
15 years 8 months ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
134
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...