---
res:
  bibo_abstract:
  - In this article we show that the boundary of the Pareto critical set of an unconstrained
    multiobjective optimization problem (MOP) consists of Pareto critical points of
    subproblems where only a subset of the set of objective functions is taken into
    account. If the Pareto critical set is completely described by its boundary (e.g.,
    if we have more objective functions than dimensions in decision space), then this
    can be used to efficiently solve the MOP by solving a number of MOPs with fewer
    objective functions. If this is not the case, the results can still give insight
    into the structure of the Pareto critical set.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Bennet
      foaf_name: Gebken, Bennet
      foaf_surname: Gebken
      foaf_workInfoHomepage: http://www.librecat.org/personId=32643
  - foaf_Person:
      foaf_givenName: Sebastian
      foaf_name: Peitz, Sebastian
      foaf_surname: Peitz
      foaf_workInfoHomepage: http://www.librecat.org/personId=47427
    orcid: https://orcid.org/0000-0002-3389-793X
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Dellnitz, Michael
      foaf_surname: Dellnitz
  bibo_doi: 10.1007/s10898-019-00737-6
  bibo_issue: '4'
  bibo_volume: 73
  dct_date: 2019^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0925-5001
  - http://id.crossref.org/issn/1573-2916
  dct_language: eng
  dct_title: On the hierarchical structure of Pareto critical sets@
...