Plateaus Can Be Harder in Multi-Objective Optimization

Friedrich, Tobias; Hebbinhaus, Nils; Neumann, Frank

doi:10.1016/j.tcs.2009.06.020

Local TagsRelease HistoryDetailsSummary

Plateaus Can Be Harder in Multi-Objective Optimization

Friedrich, T., Hebbinhaus, N., & Neumann, F. (2010). Plateaus Can Be Harder in Multi-Objective Optimization. Theoretical Computer Science, 411(6), 854-864. doi:10.1016/j.tcs.2009.06.020.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-16B7-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-2833-4

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Friedrich, Tobias¹, Author
Hebbinhaus, Nils², Author
Neumann, Frank¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2Max Planck Society, ou_persistent13

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2010Date issued: 2010

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 536722
DOI: 10.1016/j.tcs.2009.06.020
URI: http://dx.doi.org/10.1016/j.tcs.2009.06.020
Other: Local-ID: C1256428004B93B8-BD82BA48FCBC30BDC12576A70053C4B9-FHN10

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical Computer Science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 411 (6) Sequence Number: - Start / End Page: 854 - 864 Identifier: ISSN: 0304-3975