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

Friedrich, Tobias; He, Jun; Hebbinghaus, Nils; Neumann, Frank; Witt, Carsten

doi:10.1162/EVCO_a_00003

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1601-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-25DD-D

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Friedrich, Tobias¹, Author
He, Jun², Author
Hebbinghaus, Nils¹, Author
Neumann, Frank¹, Author
Witt, Carsten², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2010

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 536721
DOI: 10.1162/EVCO_a_00003
URI: http://dx.doi.org/10.1162/EVCO_a_00003
Other: Local-ID: C1256428004B93B8-7BB1F28734D0480EC12576A70053AD46-FHHNW10

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Evolutionary Computation

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Cambridge, Mass. : MIT Press

Pages: - Volume / Issue: 18 (4) Sequence Number: - Start / End Page: 617 - 633 Identifier: ISSN: 1063-6560