de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Approximating Covering Problems by Randomized Search Heuristics using Multi-objective Models

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44447

Friedrich,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44598

Hebbinghaus,  Nils
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45115

Neumann,  Frank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., & Witt, C. (2010). Approximating Covering Problems by Randomized Search Heuristics using Multi-objective Models. Evolutionary Computation, 18(4), 617-633. doi:10.1162/EVCO_a_00003.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1601-8
Abstract
There is no abstract available