454 search results - page 17 / 91 » On improving approximate solutions by evolutionary algorithm... |
133
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
138
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we borrow the concept of reference direction approach from the multi-criterion decision-making literature and combine it with an EMO procedure to develop an algorit...
110
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
EPIA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. One of the most influential factors in the quality of the solutions found by an evolutionary algorithm is the appropriateness of the fitness function. Specifically in ...
CEC
2007
IEEE
15 years 7 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. ...