Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Nat Comput

Search In Journal Title:

Abbravation: Natural Computing

Search In Journal Abbravation:

Publisher

Springer Netherlands

Search In Publisher:

DOI

10.1016/j.ambp.2005.11.002

Search In DOI:

ISSN

1572-9796

Search In ISSN:
Search In Title Of Papers:

Minimum spanning trees made easier via multiobjec

Authors: Frank Neumann Ingo Wegener
Publish Date: 2006/04/27
Volume: 5, Issue: 3, Pages: 305-319
PDF Link

Abstract

Many realworld problems are multiobjective optimization problems and evolutionary algorithms are quite successful on such problems Since the task is to compute or approximate the Pareto front multiobjective optimization problems are considered as more difficult than singleobjective problems One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms Therefore it is possible that a singleobjective problem can be solved more efficiently via a generalized multiobjective model of the problem That this is indeed the case is proved by investigating the computation of minimum spanning trees


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: