---
_id: '157'
abstract:
- lang: eng
  text: Consider a scheduling problem in which a set of jobs with interjob communication,
    canonically represented by a weighted tree, needs to be scheduled on m parallel
    processors interconnected by a shared communication channel. In each time step,
    we may allow any processed job to use a certain capacity of the channel in order
    to satisfy (parts of) its communication demands to adjacent jobs processed in
    parallel. The goal is to find a schedule that minimizes the makespan and in which
    communication demands of all jobs are satisfied.We show that this problem is NP-hard
    in the strong sense even if the number of processors and the maximum degree of
    the underlying tree is constant.Consequently, we design and analyze simple approximation
    algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio
    of 5/2 in case of arbitrary trees.
author:
- first_name: Jürgen
  full_name: König, Jürgen
  last_name: König
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob
    Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ;
    2016:563--577. doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>'
  apa: König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016).
    Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i> (pp. 563--577). <a href="https://doi.org/10.1007/978-3-319-48749-6_41">https://doi.org/10.1007/978-3-319-48749-6_41</a>
  bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS},
    title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>},
    booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander
    and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577},
    collection={LNCS} }'
  chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
    Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In
    <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization
    and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-48749-6_41">https://doi.org/10.1007/978-3-319-48749-6_41</a>.
  ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
    with Interjob Communication on Parallel Processors,” in <i>Proceedings of the
    10th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA)</i>, 2016, pp. 563--577.
  mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
    <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization
    and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>.
  short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA), 2016, pp. 563--577.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_41
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:50:29Z
  date_updated: 2018-03-21T12:50:29Z
  file_id: '1549'
  file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf
  file_size: 753147
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:50:29Z
has_accepted_license: '1'
page: 563--577
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Scheduling with Interjob Communication on Parallel Processors
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '149'
abstract:
- lang: eng
  text: 'In this paper we consider a strategic variant of the online facility location
    problem. Given is a graph in which each node serves two roles: it is a strategic
    client stating requests as well as a potential location for a facility. In each
    time step one client states a request which induces private costs equal to the
    distance to the closest facility. Before serving, the clients may collectively
    decide to open new facilities, sharing the corresponding price. Instead of optimizing
    the global costs, each client acts selfishly. The prices of new facilities vary
    between nodes and also change over time, but are always bounded by some fixed
    value α. Both the requests as well as the facility prices are given by an online
    sequence and are not known in advance.We characterize the optimal strategies of
    the clients and analyze their overall performance in comparison to a centralized
    offline solution. If all players optimize their own competitiveness, the global
    performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
    to a natural subclass of strategies improves this result to O(α). We also show
    that for fixed facility costs, we can find strategies such that this bound further
    improves to O(√α).'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>'
  apa: Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility
    Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i> (pp. 593--607). <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>
  bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
    Online Facility Location}, DOI={<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>},
    booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
    Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
    }'
  chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
    Facility Location.” In <i>Proceedings of the 10th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016.
    <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>.
  ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
    in <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.
  mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>.
  short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:55:43Z
  date_updated: 2018-03-21T12:55:43Z
  file_id: '1553'
  file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
  file_size: 236253
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
  text: 'We consider online optimization problems in which certain goods have to be
    acquired in order to provide a service or infrastructure. Classically, decisions
    for such problems are considered as final: one buys the goods. However, in many
    real world applications, there is a shift away from the idea of buying goods.
    Instead, leasing is often a more flexible and lucrative business model. Research
    has realized this shift and recently initiated the theoretical study of leasing
    models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
    optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
    2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
    of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
    and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
    and suggest a more systematic study of leasing aspects for a class of online optimization
    problems. We provide two major technical results. We introduce the leasing variant
    of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
    n, m, and K being the number of elements, sets, and leases, respectively). Our
    results also imply improvements for the non-leasing variant of online set cover.
    Moreover, we extend results for the leasing variant of online facility location.
    Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
    algorithm for this problem (with n and K being the number of clients and leases,
    respectively). We remove the dependency on n (and, thereby, on time). In general,
    this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
    For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: 'Peter '
  full_name: 'Pietrzyk, Peter '
  last_name: Pietrzyk
citation:
  ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
    the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216.
    doi:<a href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>
  apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk,
    P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>,
    (4), 1197--1216. <a href="https://doi.org/10.1007/s10878-015-9915-5">https://doi.org/10.1007/s10878-015-9915-5</a>
  bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
    the price of leasing online}, DOI={<a href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>},
    number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
    author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
    auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
    }'
  chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal
    of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href="https://doi.org/10.1007/s10878-015-9915-5">https://doi.org/10.1007/s10878-015-9915-5</a>.'
  ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
    “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>,
    no. 4, pp. 1197--1216, 2016.
  mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal
    of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a
    href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>.
  short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
    Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:57:25Z
  date_updated: 2018-11-02T15:57:25Z
  file_id: '5318'
  file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
  file_size: 654903
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '144'
abstract:
- lang: eng
  text: 'Following the direction pioneered by Fiat and Papadimitriou in their 2010
    paper [12], we study the complexity of deciding the existence of mixed equilibria
    for minimization games where players use valuations other than expectation to
    evaluate their costs. We consider risk-averse players seeking to minimize the
    sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative
    and vanishes exactly when the cost incurred to a player is constant over all choices
    of strategies by the other players. In a V-equilibrium, no player could unilaterally
    reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if
    all strategies supported in a player''s best-response mixed strategy incur the
    same conditional expectation of her cost. We introduce E-strict concavity and
    observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation
    property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation
    property, which we exploit to prove two main complexity results, the first of
    their kind, for the two simplest cases of the problem:• Two strategies: Deciding
    the existence of a V-equilibrium is strongly NP-hard for the restricted class
    of player-specific scheduling games on two ordered links [22], when choosing R
    as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum
    of even moments of small order.• Two players: Deciding the existence of a V-equilibrium
    is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the
    risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the
    concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence
    of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation
    property and a few additional properties for V; its proof involves a reduction
    with a single parameter, which can be chosen efficiently so that each valuation
    satisfies the additional properties.'
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
citation:
  ama: Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations.
    <i>Theoretical Computer Science</i>. 2016;634:67-96. doi:<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>
  apa: Monien, B., &#38; Mavronicolas, M. (2016). The complexity of equilibria for
    risk-modeling valuations. <i>Theoretical Computer Science</i>, <i>634</i>, 67–96.
    <a href="https://doi.org/10.1016/j.tcs.2016.04.013">https://doi.org/10.1016/j.tcs.2016.04.013</a>
  bibtex: '@article{Monien_Mavronicolas_2016, title={The complexity of equilibria
    for risk-modeling valuations}, volume={634}, DOI={<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien,
    Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }'
  chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria
    for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i> 634 (2016):
    67–96. <a href="https://doi.org/10.1016/j.tcs.2016.04.013">https://doi.org/10.1016/j.tcs.2016.04.013</a>.'
  ieee: B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling
    valuations,” <i>Theoretical Computer Science</i>, vol. 634, pp. 67–96, 2016.
  mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for
    Risk-Modeling Valuations.” <i>Theoretical Computer Science</i>, vol. 634, Elsevier,
    2016, pp. 67–96, doi:<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>.
  short: B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:51:59Z
ddc:
- '040'
doi: 10.1016/j.tcs.2016.04.013
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:58:42Z
  date_updated: 2018-03-21T12:58:42Z
  file_id: '1557'
  file_name: 144-Monien_Mavronicolas-TCS2016_01.pdf
  file_size: 633599
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:58:42Z
has_accepted_license: '1'
intvolume: '       634'
language:
- iso: eng
page: 67-96
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: The complexity of equilibria for risk-modeling valuations
type: journal_article
user_id: '42447'
volume: 634
year: '2016'
...
---
_id: '29962'
author:
- first_name: Karl Stephan Christian
  full_name: Stille, Karl Stephan Christian
  id: '30152'
  last_name: Stille
  orcid: 0000-0002-4212-6555
- first_name: Joachim
  full_name: Böcker, Joachim
  id: '66'
  last_name: Böcker
  orcid: 0000-0002-8480-7295
- first_name: Norbert
  full_name: Fröhleke, Norbert
  last_name: Fröhleke
- first_name: Ralf
  full_name: Bettentrup, Ralf
  last_name: Bettentrup
- first_name: Ingo
  full_name: Kaiser, Ingo
  last_name: Kaiser
citation:
  ama: 'Stille KSC, Böcker J, Fröhleke N, Bettentrup R, Kaiser I. Integration of home
    photovoltaic generation into electricity tariff for load optimization. In: <i>2016
    4th International Istanbul Smart Grid Congress and Fair (ICSG)</i>. IEEE; 2016.
    doi:<a href="https://doi.org/10.1109/sgcf.2016.7492441">10.1109/sgcf.2016.7492441</a>'
  apa: Stille, K. S. C., Böcker, J., Fröhleke, N., Bettentrup, R., &#38; Kaiser, I.
    (2016). Integration of home photovoltaic generation into electricity tariff for
    load optimization. <i>2016 4th International Istanbul Smart Grid Congress and
    Fair (ICSG)</i>. <a href="https://doi.org/10.1109/sgcf.2016.7492441">https://doi.org/10.1109/sgcf.2016.7492441</a>
  bibtex: '@inproceedings{Stille_Böcker_Fröhleke_Bettentrup_Kaiser_2016, title={Integration
    of home photovoltaic generation into electricity tariff for load optimization},
    DOI={<a href="https://doi.org/10.1109/sgcf.2016.7492441">10.1109/sgcf.2016.7492441</a>},
    booktitle={2016 4th International Istanbul Smart Grid Congress and Fair (ICSG)},
    publisher={IEEE}, author={Stille, Karl Stephan Christian and Böcker, Joachim and
    Fröhleke, Norbert and Bettentrup, Ralf and Kaiser, Ingo}, year={2016} }'
  chicago: Stille, Karl Stephan Christian, Joachim Böcker, Norbert Fröhleke, Ralf
    Bettentrup, and Ingo Kaiser. “Integration of Home Photovoltaic Generation into
    Electricity Tariff for Load Optimization.” In <i>2016 4th International Istanbul
    Smart Grid Congress and Fair (ICSG)</i>. IEEE, 2016. <a href="https://doi.org/10.1109/sgcf.2016.7492441">https://doi.org/10.1109/sgcf.2016.7492441</a>.
  ieee: 'K. S. C. Stille, J. Böcker, N. Fröhleke, R. Bettentrup, and I. Kaiser, “Integration
    of home photovoltaic generation into electricity tariff for load optimization,”
    2016, doi: <a href="https://doi.org/10.1109/sgcf.2016.7492441">10.1109/sgcf.2016.7492441</a>.'
  mla: Stille, Karl Stephan Christian, et al. “Integration of Home Photovoltaic Generation
    into Electricity Tariff for Load Optimization.” <i>2016 4th International Istanbul
    Smart Grid Congress and Fair (ICSG)</i>, IEEE, 2016, doi:<a href="https://doi.org/10.1109/sgcf.2016.7492441">10.1109/sgcf.2016.7492441</a>.
  short: 'K.S.C. Stille, J. Böcker, N. Fröhleke, R. Bettentrup, I. Kaiser, in: 2016
    4th International Istanbul Smart Grid Congress and Fair (ICSG), IEEE, 2016.'
date_created: 2022-02-23T09:12:00Z
date_updated: 2022-02-23T09:43:40Z
department:
- _id: '52'
doi: 10.1109/sgcf.2016.7492441
language:
- iso: eng
publication: 2016 4th International Istanbul Smart Grid Congress and Fair (ICSG)
publication_status: published
publisher: IEEE
status: public
title: Integration of home photovoltaic generation into electricity tariff for load
  optimization
type: conference
user_id: '66'
year: '2016'
...
---
_id: '29960'
author:
- first_name: Karl Stephan Christian
  full_name: Stille, Karl Stephan Christian
  id: '30152'
  last_name: Stille
  orcid: 0000-0002-4212-6555
- first_name: Joachim
  full_name: Böcker, Joachim
  id: '66'
  last_name: Böcker
  orcid: 0000-0002-8480-7295
- first_name: Norbert
  full_name: Fröhleke, Norbert
  last_name: Fröhleke
- first_name: Ralf
  full_name: Bettentrup, Ralf
  last_name: Bettentrup
- first_name: Ingo
  full_name: Kaiser, Ingo
  last_name: Kaiser
citation:
  ama: 'Stille KSC, Böcker J, Fröhleke N, Bettentrup R, Kaiser I. Supervisional load
    optimization for households with intelligent domestic appliances. In: <i>2016
    10th International Conference on Compatibility, Power Electronics and Power Engineering
    (CPE-POWERENG)</i>. IEEE; 2016. doi:<a href="https://doi.org/10.1109/cpe.2016.7544176">10.1109/cpe.2016.7544176</a>'
  apa: Stille, K. S. C., Böcker, J., Fröhleke, N., Bettentrup, R., &#38; Kaiser, I.
    (2016). Supervisional load optimization for households with intelligent domestic
    appliances. <i>2016 10th International Conference on Compatibility, Power Electronics
    and Power Engineering (CPE-POWERENG)</i>. <a href="https://doi.org/10.1109/cpe.2016.7544176">https://doi.org/10.1109/cpe.2016.7544176</a>
  bibtex: '@inproceedings{Stille_Böcker_Fröhleke_Bettentrup_Kaiser_2016, title={Supervisional
    load optimization for households with intelligent domestic appliances}, DOI={<a
    href="https://doi.org/10.1109/cpe.2016.7544176">10.1109/cpe.2016.7544176</a>},
    booktitle={2016 10th International Conference on Compatibility, Power Electronics
    and Power Engineering (CPE-POWERENG)}, publisher={IEEE}, author={Stille, Karl
    Stephan Christian and Böcker, Joachim and Fröhleke, Norbert and Bettentrup, Ralf
    and Kaiser, Ingo}, year={2016} }'
  chicago: Stille, Karl Stephan Christian, Joachim Böcker, Norbert Fröhleke, Ralf
    Bettentrup, and Ingo Kaiser. “Supervisional Load Optimization for Households with
    Intelligent Domestic Appliances.” In <i>2016 10th International Conference on
    Compatibility, Power Electronics and Power Engineering (CPE-POWERENG)</i>. IEEE,
    2016. <a href="https://doi.org/10.1109/cpe.2016.7544176">https://doi.org/10.1109/cpe.2016.7544176</a>.
  ieee: 'K. S. C. Stille, J. Böcker, N. Fröhleke, R. Bettentrup, and I. Kaiser, “Supervisional
    load optimization for households with intelligent domestic appliances,” 2016,
    doi: <a href="https://doi.org/10.1109/cpe.2016.7544176">10.1109/cpe.2016.7544176</a>.'
  mla: Stille, Karl Stephan Christian, et al. “Supervisional Load Optimization for
    Households with Intelligent Domestic Appliances.” <i>2016 10th International Conference
    on Compatibility, Power Electronics and Power Engineering (CPE-POWERENG)</i>,
    IEEE, 2016, doi:<a href="https://doi.org/10.1109/cpe.2016.7544176">10.1109/cpe.2016.7544176</a>.
  short: 'K.S.C. Stille, J. Böcker, N. Fröhleke, R. Bettentrup, I. Kaiser, in: 2016
    10th International Conference on Compatibility, Power Electronics and Power Engineering
    (CPE-POWERENG), IEEE, 2016.'
date_created: 2022-02-23T09:11:10Z
date_updated: 2022-02-23T10:06:56Z
department:
- _id: '52'
doi: 10.1109/cpe.2016.7544176
language:
- iso: eng
publication: 2016 10th International Conference on Compatibility, Power Electronics
  and Power Engineering (CPE-POWERENG)
publication_status: published
publisher: IEEE
status: public
title: Supervisional load optimization for households with intelligent domestic appliances
type: conference
user_id: '66'
year: '2016'
...
---
_id: '30607'
author:
- first_name: Carsten
  full_name: Henkenius, Carsten
  last_name: Henkenius
- first_name: Norbert
  full_name: Fröhleke, Norbert
  last_name: Fröhleke
- first_name: Joachim
  full_name: Böcker, Joachim
  id: '66'
  last_name: Böcker
  orcid: 0000-0002-8480-7295
- first_name: Heiko
  full_name: Figge, Heiko
  last_name: Figge
citation:
  ama: 'Henkenius C, Fröhleke N, Böcker J, Figge H. Numerical optimization of passive
    line filter components for suppression of electromagnetic interference (EMI).
    In: <i>2016 IEEE Applied Power Electronics Conference and Exposition (APEC)</i>.
    IEEE; 2016. doi:<a href="https://doi.org/10.1109/apec.2016.7468073">10.1109/apec.2016.7468073</a>'
  apa: Henkenius, C., Fröhleke, N., Böcker, J., &#38; Figge, H. (2016). Numerical
    optimization of passive line filter components for suppression of electromagnetic
    interference (EMI). <i>2016 IEEE Applied Power Electronics Conference and Exposition
    (APEC)</i>. <a href="https://doi.org/10.1109/apec.2016.7468073">https://doi.org/10.1109/apec.2016.7468073</a>
  bibtex: '@inproceedings{Henkenius_Fröhleke_Böcker_Figge_2016, title={Numerical optimization
    of passive line filter components for suppression of electromagnetic interference
    (EMI)}, DOI={<a href="https://doi.org/10.1109/apec.2016.7468073">10.1109/apec.2016.7468073</a>},
    booktitle={2016 IEEE Applied Power Electronics Conference and Exposition (APEC)},
    publisher={IEEE}, author={Henkenius, Carsten and Fröhleke, Norbert and Böcker,
    Joachim and Figge, Heiko}, year={2016} }'
  chicago: Henkenius, Carsten, Norbert Fröhleke, Joachim Böcker, and Heiko Figge.
    “Numerical Optimization of Passive Line Filter Components for Suppression of Electromagnetic
    Interference (EMI).” In <i>2016 IEEE Applied Power Electronics Conference and
    Exposition (APEC)</i>. IEEE, 2016. <a href="https://doi.org/10.1109/apec.2016.7468073">https://doi.org/10.1109/apec.2016.7468073</a>.
  ieee: 'C. Henkenius, N. Fröhleke, J. Böcker, and H. Figge, “Numerical optimization
    of passive line filter components for suppression of electromagnetic interference
    (EMI),” 2016, doi: <a href="https://doi.org/10.1109/apec.2016.7468073">10.1109/apec.2016.7468073</a>.'
  mla: Henkenius, Carsten, et al. “Numerical Optimization of Passive Line Filter Components
    for Suppression of Electromagnetic Interference (EMI).” <i>2016 IEEE Applied Power
    Electronics Conference and Exposition (APEC)</i>, IEEE, 2016, doi:<a href="https://doi.org/10.1109/apec.2016.7468073">10.1109/apec.2016.7468073</a>.
  short: 'C. Henkenius, N. Fröhleke, J. Böcker, H. Figge, in: 2016 IEEE Applied Power
    Electronics Conference and Exposition (APEC), IEEE, 2016.'
date_created: 2022-03-28T08:00:21Z
date_updated: 2022-03-28T08:55:16Z
department:
- _id: '52'
doi: 10.1109/apec.2016.7468073
language:
- iso: eng
publication: 2016 IEEE Applied Power Electronics Conference and Exposition (APEC)
publication_status: published
publisher: IEEE
status: public
title: Numerical optimization of passive line filter components for suppression of
  electromagnetic interference (EMI)
type: conference
user_id: '66'
year: '2016'
...
---
_id: '30605'
author:
- first_name: Sven
  full_name: Bolte, Sven
  last_name: Bolte
- first_name: Norbert
  full_name: Fröhleke, Norbert
  last_name: Fröhleke
- first_name: Joachim
  full_name: Böcker, Joachim
  id: '66'
  last_name: Böcker
  orcid: 0000-0002-8480-7295
citation:
  ama: 'Bolte S, Fröhleke N, Böcker J. Efficiency optimization for a power factor
    correction (PFC) rectifier with gallium nitride transistor. In: <i>2015 IEEE 3rd
    Workshop on Wide Bandgap Power Devices and Applications (WiPDA)</i>. IEEE; 2016.
    doi:<a href="https://doi.org/10.1109/wipda.2015.7369288">10.1109/wipda.2015.7369288</a>'
  apa: Bolte, S., Fröhleke, N., &#38; Böcker, J. (2016). Efficiency optimization for
    a power factor correction (PFC) rectifier with gallium nitride transistor. <i>2015
    IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications (WiPDA)</i>.
    <a href="https://doi.org/10.1109/wipda.2015.7369288">https://doi.org/10.1109/wipda.2015.7369288</a>
  bibtex: '@inproceedings{Bolte_Fröhleke_Böcker_2016, title={Efficiency optimization
    for a power factor correction (PFC) rectifier with gallium nitride transistor},
    DOI={<a href="https://doi.org/10.1109/wipda.2015.7369288">10.1109/wipda.2015.7369288</a>},
    booktitle={2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications
    (WiPDA)}, publisher={IEEE}, author={Bolte, Sven and Fröhleke, Norbert and Böcker,
    Joachim}, year={2016} }'
  chicago: Bolte, Sven, Norbert Fröhleke, and Joachim Böcker. “Efficiency Optimization
    for a Power Factor Correction (PFC) Rectifier with Gallium Nitride Transistor.”
    In <i>2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications (WiPDA)</i>.
    IEEE, 2016. <a href="https://doi.org/10.1109/wipda.2015.7369288">https://doi.org/10.1109/wipda.2015.7369288</a>.
  ieee: 'S. Bolte, N. Fröhleke, and J. Böcker, “Efficiency optimization for a power
    factor correction (PFC) rectifier with gallium nitride transistor,” 2016, doi:
    <a href="https://doi.org/10.1109/wipda.2015.7369288">10.1109/wipda.2015.7369288</a>.'
  mla: Bolte, Sven, et al. “Efficiency Optimization for a Power Factor Correction
    (PFC) Rectifier with Gallium Nitride Transistor.” <i>2015 IEEE 3rd Workshop on
    Wide Bandgap Power Devices and Applications (WiPDA)</i>, IEEE, 2016, doi:<a href="https://doi.org/10.1109/wipda.2015.7369288">10.1109/wipda.2015.7369288</a>.
  short: 'S. Bolte, N. Fröhleke, J. Böcker, in: 2015 IEEE 3rd Workshop on Wide Bandgap
    Power Devices and Applications (WiPDA), IEEE, 2016.'
date_created: 2022-03-28T07:42:01Z
date_updated: 2022-03-28T08:55:29Z
department:
- _id: '52'
doi: 10.1109/wipda.2015.7369288
language:
- iso: eng
publication: 2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications
  (WiPDA)
publication_status: published
publisher: IEEE
status: public
title: Efficiency optimization for a power factor correction (PFC) rectifier with
  gallium nitride transistor
type: conference
user_id: '66'
year: '2016'
...
---
_id: '28483'
author:
- first_name: Andrés
  full_name: Marín López, Andrés
  last_name: Marín López
- first_name: Florina
  full_name: Almenárez-Mendoza, Florina
  last_name: Almenárez-Mendoza
- first_name: Patricia
  full_name: Arias Cabarcos, Patricia
  id: '92804'
  last_name: Arias Cabarcos
- first_name: Daniel
  full_name: Díaz Sánchez, Daniel
  last_name: Díaz Sánchez
citation:
  ama: 'Marín López A, Almenárez-Mendoza F, Arias Cabarcos P, Díaz Sánchez D. Wi-Fi
    Direct: Lessons learned. In: <i>2016 Mediterranean Ad Hoc Networking Workshop,
    Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June 20-22, 2016</i>. {IEEE}; 2016:1-8.
    doi:<a href="https://doi.org/10.1109/MedHocNet.2016.7528493">10.1109/MedHocNet.2016.7528493</a>'
  apa: 'Marín López, A., Almenárez-Mendoza, F., Arias Cabarcos, P., &#38; Díaz Sánchez,
    D. (2016). Wi-Fi Direct: Lessons learned. <i>2016 Mediterranean Ad Hoc Networking
    Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June 20-22, 2016</i>,
    1–8. <a href="https://doi.org/10.1109/MedHocNet.2016.7528493">https://doi.org/10.1109/MedHocNet.2016.7528493</a>'
  bibtex: '@inproceedings{Marín López_Almenárez-Mendoza_Arias Cabarcos_Díaz Sánchez_2016,
    title={Wi-Fi Direct: Lessons learned}, DOI={<a href="https://doi.org/10.1109/MedHocNet.2016.7528493">10.1109/MedHocNet.2016.7528493</a>},
    booktitle={2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
    i la Geltru, Spain, June 20-22, 2016}, publisher={{IEEE}}, author={Marín López,
    Andrés and Almenárez-Mendoza, Florina and Arias Cabarcos, Patricia and Díaz Sánchez,
    Daniel}, year={2016}, pages={1–8} }'
  chicago: 'Marín López, Andrés, Florina Almenárez-Mendoza, Patricia Arias Cabarcos,
    and Daniel Díaz Sánchez. “Wi-Fi Direct: Lessons Learned.” In <i>2016 Mediterranean
    Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June
    20-22, 2016</i>, 1–8. {IEEE}, 2016. <a href="https://doi.org/10.1109/MedHocNet.2016.7528493">https://doi.org/10.1109/MedHocNet.2016.7528493</a>.'
  ieee: 'A. Marín López, F. Almenárez-Mendoza, P. Arias Cabarcos, and D. Díaz Sánchez,
    “Wi-Fi Direct: Lessons learned,” in <i>2016 Mediterranean Ad Hoc Networking Workshop,
    Med-Hoc-Net 2016, Vilanova i la Geltru, Spain, June 20-22, 2016</i>, 2016, pp.
    1–8, doi: <a href="https://doi.org/10.1109/MedHocNet.2016.7528493">10.1109/MedHocNet.2016.7528493</a>.'
  mla: 'Marín López, Andrés, et al. “Wi-Fi Direct: Lessons Learned.” <i>2016 Mediterranean
    Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June
    20-22, 2016</i>, {IEEE}, 2016, pp. 1–8, doi:<a href="https://doi.org/10.1109/MedHocNet.2016.7528493">10.1109/MedHocNet.2016.7528493</a>.'
  short: 'A. Marín López, F. Almenárez-Mendoza, P. Arias Cabarcos, D. Díaz Sánchez,
    in: 2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
    i La Geltru, Spain, June 20-22, 2016, {IEEE}, 2016, pp. 1–8.'
date_created: 2021-12-08T19:13:50Z
date_updated: 2022-01-27T17:00:16Z
doi: 10.1109/MedHocNet.2016.7528493
extern: '1'
language:
- iso: eng
page: 1-8
publication: 2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
  i la Geltru, Spain, June 20-22, 2016
publisher: '{IEEE}'
status: public
title: 'Wi-Fi Direct: Lessons learned'
type: conference
user_id: '92804'
year: '2016'
...
---
_id: '35989'
author:
- first_name: Kirsten
  full_name: Schlegel-Matthies, Kirsten
  id: '459'
  last_name: Schlegel-Matthies
- first_name: Gerd
  full_name: Gigerenzer, Gerd
  last_name: Gigerenzer
- first_name: Gert G.
  full_name: Wagner, Gert G.
  last_name: Wagner
citation:
  ama: Schlegel-Matthies K, Gigerenzer G, Wagner GG. <i>Digitale Welt und Gesundheit.
    eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich</i>.;
    2016.
  apa: Schlegel-Matthies, K., Gigerenzer, G., &#38; Wagner, G. G. (2016). <i>Digitale
    Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
    im Gesundheitsbereich</i>.
  bibtex: '@book{Schlegel-Matthies_Gigerenzer_Wagner_2016, place={Berlin}, title={Digitale
    Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
    im Gesundheitsbereich}, author={Schlegel-Matthies, Kirsten and Gigerenzer, Gerd
    and Wagner, Gert G.}, year={2016} }'
  chicago: Schlegel-Matthies, Kirsten, Gerd Gigerenzer, and Gert G. Wagner. <i>Digitale
    Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
    im Gesundheitsbereich</i>. Berlin, 2016.
  ieee: K. Schlegel-Matthies, G. Gigerenzer, and G. G. Wagner, <i>Digitale Welt und
    Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich</i>.
    Berlin, 2016.
  mla: Schlegel-Matthies, Kirsten, et al. <i>Digitale Welt und Gesundheit. eHealth
    und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich</i>.
    2016.
  short: K. Schlegel-Matthies, G. Gigerenzer, G.G. Wagner, Digitale Welt und Gesundheit.
    eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich,
    Berlin, 2016.
date_created: 2023-01-11T10:46:12Z
date_updated: 2023-01-11T10:46:50Z
department:
- _id: '35'
- _id: '17'
- _id: '22'
- _id: '396'
language:
- iso: ger
main_file_link:
- open_access: '1'
  url: https://www.svr-verbraucherfragen.de/wp-content/uploads/Digitale-Welt-und-Gesundheit.pdf
oa: '1'
page: '51'
place: Berlin
publication_identifier:
  issn:
  - 2365-919X
publication_status: published
status: public
title: Digitale Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der
  Digitalisierung im Gesundheitsbereich
type: working_paper
user_id: '459'
year: '2016'
...
---
_id: '4239'
abstract:
- lang: eng
  text: "Confocal Raman spectroscopy is applied to identify ferroelectric domain structure
    sensitive\r\nphonon modes in potassium titanyl phosphate. Therefore, polarization-dependent
    measurements in\r\nvarious scattering configurations have been performed to characterize
    the fundamental Raman\r\nspectra of the material. The obtained spectra are discussed
    qualitatively based on an internal mode\r\nassignment. In the main part of this
    work, we have characterized z-cut periodically poled potassium\r\ntitanyl phosphate
    in terms of polarity- and structure-sensitive phonon modes. Here, we find vibrations\r\nwhose
    intensities are linked to the ferroelectric domain walls. We interpret this in
    terms of\r\nchanges in the polarizability originating from strain induced by domain
    boundaries and the inner\r\nfield distribution. Hence, a direct and 3D visualization
    of ferroelectric domain structures becomes\r\npossible in potassium titanyl phosphate."
article_number: '044103'
article_type: original
author:
- first_name: Michael
  full_name: Rüsing, Michael
  id: '22501'
  last_name: Rüsing
  orcid: 0000-0003-4682-4577
- first_name: Christof
  full_name: Eigner, Christof
  id: '13244'
  last_name: Eigner
  orcid: https://orcid.org/0000-0002-5693-3083
- first_name: P.
  full_name: Mackwitz, P.
  last_name: Mackwitz
- first_name: Gerhard
  full_name: Berth, Gerhard
  id: '53'
  last_name: Berth
- first_name: Christine
  full_name: Silberhorn, Christine
  id: '26263'
  last_name: Silberhorn
- first_name: Artur
  full_name: Zrenner, Artur
  id: '606'
  last_name: Zrenner
  orcid: 0000-0002-5190-0944
citation:
  ama: 'Rüsing M, Eigner C, Mackwitz P, Berth G, Silberhorn C, Zrenner A. Identification
    of ferroelectric domain structure sensitive phonon modes in potassium titanyl
    phosphate: A fundamental study. <i>Journal of Applied Physics</i>. 2016;119(4).
    doi:<a href="https://doi.org/10.1063/1.4940964">10.1063/1.4940964</a>'
  apa: 'Rüsing, M., Eigner, C., Mackwitz, P., Berth, G., Silberhorn, C., &#38; Zrenner,
    A. (2016). Identification of ferroelectric domain structure sensitive phonon modes
    in potassium titanyl phosphate: A fundamental study. <i>Journal of Applied Physics</i>,
    <i>119</i>(4), Article 044103. <a href="https://doi.org/10.1063/1.4940964">https://doi.org/10.1063/1.4940964</a>'
  bibtex: '@article{Rüsing_Eigner_Mackwitz_Berth_Silberhorn_Zrenner_2016, title={Identification
    of ferroelectric domain structure sensitive phonon modes in potassium titanyl
    phosphate: A fundamental study}, volume={119}, DOI={<a href="https://doi.org/10.1063/1.4940964">10.1063/1.4940964</a>},
    number={4044103}, journal={Journal of Applied Physics}, publisher={AIP Publishing},
    author={Rüsing, Michael and Eigner, Christof and Mackwitz, P. and Berth, Gerhard
    and Silberhorn, Christine and Zrenner, Artur}, year={2016} }'
  chicago: 'Rüsing, Michael, Christof Eigner, P. Mackwitz, Gerhard Berth, Christine
    Silberhorn, and Artur Zrenner. “Identification of Ferroelectric Domain Structure
    Sensitive Phonon Modes in Potassium Titanyl Phosphate: A Fundamental Study.” <i>Journal
    of Applied Physics</i> 119, no. 4 (2016). <a href="https://doi.org/10.1063/1.4940964">https://doi.org/10.1063/1.4940964</a>.'
  ieee: 'M. Rüsing, C. Eigner, P. Mackwitz, G. Berth, C. Silberhorn, and A. Zrenner,
    “Identification of ferroelectric domain structure sensitive phonon modes in potassium
    titanyl phosphate: A fundamental study,” <i>Journal of Applied Physics</i>, vol.
    119, no. 4, Art. no. 044103, 2016, doi: <a href="https://doi.org/10.1063/1.4940964">10.1063/1.4940964</a>.'
  mla: 'Rüsing, Michael, et al. “Identification of Ferroelectric Domain Structure
    Sensitive Phonon Modes in Potassium Titanyl Phosphate: A Fundamental Study.” <i>Journal
    of Applied Physics</i>, vol. 119, no. 4, 044103, AIP Publishing, 2016, doi:<a
    href="https://doi.org/10.1063/1.4940964">10.1063/1.4940964</a>.'
  short: M. Rüsing, C. Eigner, P. Mackwitz, G. Berth, C. Silberhorn, A. Zrenner, Journal
    of Applied Physics 119 (2016).
date_created: 2018-08-29T08:21:00Z
date_updated: 2023-10-09T08:32:15Z
department:
- _id: '15'
- _id: '230'
- _id: '35'
- _id: '288'
doi: 10.1063/1.4940964
intvolume: '       119'
issue: '4'
language:
- iso: eng
project:
- _id: '53'
  grant_number: '231447078'
  name: TRR 142
- _id: '55'
  name: TRR 142 - Project Area B
- _id: '68'
  grant_number: '231447078'
  name: TRR 142 - Subproject B3
publication: Journal of Applied Physics
publication_identifier:
  issn:
  - 0021-8979
  - 1089-7550
publication_status: published
publisher: AIP Publishing
status: public
title: 'Identification of ferroelectric domain structure sensitive phonon modes in
  potassium titanyl phosphate: A fundamental study'
type: journal_article
user_id: '14931'
volume: 119
year: '2016'
...
---
_id: '46364'
abstract:
- lang: eng
  text: Automated algorithm configuration procedures play an increasingly important
    role in the development and application of algorithms for a wide range of computationally
    challenging problems. Until very recently, these configuration procedures were
    limited to optimising a single performance objective, such as the running time
    or solution quality achieved by the algorithm being configured. However, in many
    applications there is more than one performance objective of interest. This gives
    rise to the multi-objective automatic algorithm configuration problem, which involves
    finding a Pareto set of configurations of a given target algorithm that characterises
    trade-offs between multiple performance objectives. In this work, we introduce
    MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective
    algorithm configuration framework ParamILS, and demonstrate that it produces good
    results on several challenging bi-objective algorithm configuration scenarios
    compared to a base-line obtained from using a state-of-the-art single-objective
    algorithm configurator.
author:
- first_name: A
  full_name: Blot, A
  last_name: Blot
- first_name: H
  full_name: Hoos, H
  last_name: Hoos
- first_name: L
  full_name: Jourdan, L
  last_name: Jourdan
- first_name: M
  full_name: Marmion, M
  last_name: Marmion
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Blot A, Hoos H, Jourdan L, Marmion M, Trautmann H. MO-ParamILS: A Multi-objective
    Automatic Algorithm Configuration Framework. In: et al. Joaquin V, ed. <i>LION
    2016: Learning and Intelligent Optimization</i>. Vol 10079. LNTCS. Springer International
    Publishing; 2016:32–47. doi:<a href="https://doi.org/10.1007/978-3-319-50349-3_3">10.1007/978-3-319-50349-3_3</a>'
  apa: 'Blot, A., Hoos, H., Jourdan, L., Marmion, M., &#38; Trautmann, H. (2016).
    MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In
    V. et al. Joaquin (Ed.), <i>LION 2016: Learning and Intelligent Optimization</i>
    (Vol. 10079, pp. 32–47). Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-50349-3_3">https://doi.org/10.1007/978-3-319-50349-3_3</a>'
  bibtex: '@inproceedings{Blot_Hoos_Jourdan_Marmion_Trautmann_2016, place={Cham},
    series={LNTCS}, title={MO-ParamILS: A Multi-objective Automatic Algorithm Configuration
    Framework}, volume={10079}, DOI={<a href="https://doi.org/10.1007/978-3-319-50349-3_3">10.1007/978-3-319-50349-3_3</a>},
    booktitle={LION 2016: Learning and Intelligent Optimization}, publisher={Springer
    International Publishing}, author={Blot, A and Hoos, H and Jourdan, L and Marmion,
    M and Trautmann, Heike}, editor={et al. Joaquin, Vanschooren}, year={2016}, pages={32–47},
    collection={LNTCS} }'
  chicago: 'Blot, A, H Hoos, L Jourdan, M Marmion, and Heike Trautmann. “MO-ParamILS:
    A Multi-Objective Automatic Algorithm Configuration Framework.” In <i>LION 2016:
    Learning and Intelligent Optimization</i>, edited by Vanschooren et al. Joaquin,
    10079:32–47. LNTCS. Cham: Springer International Publishing, 2016. <a href="https://doi.org/10.1007/978-3-319-50349-3_3">https://doi.org/10.1007/978-3-319-50349-3_3</a>.'
  ieee: 'A. Blot, H. Hoos, L. Jourdan, M. Marmion, and H. Trautmann, “MO-ParamILS:
    A Multi-objective Automatic Algorithm Configuration Framework,” in <i>LION 2016:
    Learning and Intelligent Optimization</i>, 2016, vol. 10079, pp. 32–47, doi: <a
    href="https://doi.org/10.1007/978-3-319-50349-3_3">10.1007/978-3-319-50349-3_3</a>.'
  mla: 'Blot, A., et al. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration
    Framework.” <i>LION 2016: Learning and Intelligent Optimization</i>, edited by
    Vanschooren et al. Joaquin, vol. 10079, Springer International Publishing, 2016,
    pp. 32–47, doi:<a href="https://doi.org/10.1007/978-3-319-50349-3_3">10.1007/978-3-319-50349-3_3</a>.'
  short: 'A. Blot, H. Hoos, L. Jourdan, M. Marmion, H. Trautmann, in: V. et al. Joaquin
    (Ed.), LION 2016: Learning and Intelligent Optimization, Springer International
    Publishing, Cham, 2016, pp. 32–47.'
date_created: 2023-08-04T15:10:09Z
date_updated: 2023-10-16T13:37:50Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-50349-3_3
editor:
- first_name: Vanschooren
  full_name: et al. Joaquin, Vanschooren
  last_name: et al. Joaquin
intvolume: '     10079'
language:
- iso: eng
page: 32–47
place: Cham
publication: 'LION 2016: Learning and Intelligent Optimization'
publisher: Springer International Publishing
series_title: LNTCS
status: public
title: 'MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework'
type: conference
user_id: '15504'
volume: 10079
year: '2016'
...
---
_id: '46363'
abstract:
- lang: eng
  text: "The averaged Hausdorff distance has been proposed as an indicator for assessing
    the quality of finitely sized approximations of the Pareto front of a multiobjective
    problem. Since many set-based, iterative optimization algorithms store their currently
    best approximation in an internal archive these approximations are also termed
    archives. In case of two objectives and continuous variables it is known that
    the best approximations in terms of averaged Hausdorff distance are subsets of
    the Pareto front if it is concave. If it is linear or circularly concave the points
    of the best approximation are equally spaced.\r\n\r\nHere, it is proven that the
    optimal averaged Hausdorff approximation and the Pareto front have an empty intersection
    if the Pareto front is circularly convex. But the points of the best approximation
    are equally spaced and they rapidly approach the Pareto front for increasing size
    of the approximation."
author:
- first_name: G
  full_name: Rudolph, G
  last_name: Rudolph
- first_name: O
  full_name: Schütze, O
  last_name: Schütze
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Rudolph G, Schütze O, Trautmann H. On the Closest Averaged Hausdorff Archive
    for a Circularly Convex Pareto Front. In: Squillero G, Burelli P, eds. <i>Applications
    of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016,
    Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II</i>. Springer
    International Publishing; 2016:42–55. doi:<a href="https://doi.org/10.1007/978-3-319-31153-1_4">10.1007/978-3-319-31153-1_4</a>'
  apa: 'Rudolph, G., Schütze, O., &#38; Trautmann, H. (2016). On the Closest Averaged
    Hausdorff Archive for a Circularly Convex Pareto Front. In G. Squillero &#38;
    P. Burelli (Eds.), <i>Applications of Evolutionary Computation: 19$^th$ European
    Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
    Part II</i> (pp. 42–55). Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-31153-1_4">https://doi.org/10.1007/978-3-319-31153-1_4</a>'
  bibtex: '@inbook{Rudolph_Schütze_Trautmann_2016, place={Cham}, title={On the Closest
    Averaged Hausdorff Archive for a Circularly Convex Pareto Front}, DOI={<a href="https://doi.org/10.1007/978-3-319-31153-1_4">10.1007/978-3-319-31153-1_4</a>},
    booktitle={Applications of Evolutionary Computation: 19$^th$ European Conference,
    EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
    Part II}, publisher={Springer International Publishing}, author={Rudolph, G and
    Schütze, O and Trautmann, Heike}, editor={Squillero, G and Burelli, P}, year={2016},
    pages={42–55} }'
  chicago: 'Rudolph, G, O Schütze, and Heike Trautmann. “On the Closest Averaged Hausdorff
    Archive for a Circularly Convex Pareto Front.” In <i>Applications of Evolutionary
    Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal,
    March 30 — April 1, 2016, Proceedings, Part II</i>, edited by G Squillero and
    P Burelli, 42–55. Cham: Springer International Publishing, 2016. <a href="https://doi.org/10.1007/978-3-319-31153-1_4">https://doi.org/10.1007/978-3-319-31153-1_4</a>.'
  ieee: 'G. Rudolph, O. Schütze, and H. Trautmann, “On the Closest Averaged Hausdorff
    Archive for a Circularly Convex Pareto Front,” in <i>Applications of Evolutionary
    Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal,
    March 30 — April 1, 2016, Proceedings, Part II</i>, G. Squillero and P. Burelli,
    Eds. Cham: Springer International Publishing, 2016, pp. 42–55.'
  mla: 'Rudolph, G., et al. “On the Closest Averaged Hausdorff Archive for a Circularly
    Convex Pareto Front.” <i>Applications of Evolutionary Computation: 19$^th$ European
    Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
    Part II</i>, edited by G Squillero and P Burelli, Springer International Publishing,
    2016, pp. 42–55, doi:<a href="https://doi.org/10.1007/978-3-319-31153-1_4">10.1007/978-3-319-31153-1_4</a>.'
  short: 'G. Rudolph, O. Schütze, H. Trautmann, in: G. Squillero, P. Burelli (Eds.),
    Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications
    2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II, Springer
    International Publishing, Cham, 2016, pp. 42–55.'
date_created: 2023-08-04T15:09:14Z
date_updated: 2023-10-16T13:37:33Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-31153-1_4
editor:
- first_name: G
  full_name: Squillero, G
  last_name: Squillero
- first_name: P
  full_name: Burelli, P
  last_name: Burelli
language:
- iso: eng
page: 42–55
place: Cham
publication: 'Applications of Evolutionary Computation: 19$^th$ European Conference,
  EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part
  II'
publication_identifier:
  isbn:
  - 978-3-319-31153-1
publisher: Springer International Publishing
status: public
title: On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front
type: book_chapter
user_id: '15504'
year: '2016'
...
---
_id: '46369'
abstract:
- lang: eng
  text: This paper formally defines multimodality in multiobjective optimization (MO).
    We introduce a test-bed in which multimodal MO problems with known properties
    can be constructed as well as numerical characteristics of the resulting landscape.
    Gradient- and local search based strategies are compared on exemplary problems
    together with specific performance indicators in the multimodal MO setting. By
    this means the foundation for Exploratory Landscape Analysis in MO is provided.
author:
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Hao
  full_name: Wang, Hao
  last_name: Wang
- first_name: Mike
  full_name: Preuss, Mike
  last_name: Preuss
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
- first_name: André
  full_name: Deutz, André
  last_name: Deutz
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Michael
  full_name: Emmerich, Michael
  last_name: Emmerich
citation:
  ama: 'Kerschke P, Wang H, Preuss M, et al. Towards Analyzing Multimodality of Multiobjective
    Landscapes. In: <i>Proceedings of the 14$^th$ International Conference on Parallel
    Problem Solving from Nature (PPSN XIV)</i>. Lecture Notes in Computer Science.
    Springer; 2016:962–972. doi:<a href="https://doi.org/10.1007/978-3-319-45823-6_90">10.1007/978-3-319-45823-6_90</a>'
  apa: Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &#38;
    Emmerich, M. (2016). Towards Analyzing Multimodality of Multiobjective Landscapes.
    <i>Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
    from Nature (PPSN XIV)</i>, 962–972. <a href="https://doi.org/10.1007/978-3-319-45823-6_90">https://doi.org/10.1007/978-3-319-45823-6_90</a>
  bibtex: '@inproceedings{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2016,
    place={Edinburgh, Scotland}, series={Lecture Notes in Computer Science}, title={Towards
    Analyzing Multimodality of Multiobjective Landscapes}, DOI={<a href="https://doi.org/10.1007/978-3-319-45823-6_90">10.1007/978-3-319-45823-6_90</a>},
    booktitle={Proceedings of the 14$^th$ International Conference on Parallel Problem
    Solving from Nature (PPSN XIV)}, publisher={Springer}, author={Kerschke, Pascal
    and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann,
    Heike and Emmerich, Michael}, year={2016}, pages={962–972}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz,
    Heike Trautmann, and Michael Emmerich. “Towards Analyzing Multimodality of Multiobjective
    Landscapes.” In <i>Proceedings of the 14$^th$ International Conference on Parallel
    Problem Solving from Nature (PPSN XIV)</i>, 962–972. Lecture Notes in Computer
    Science. Edinburgh, Scotland: Springer, 2016. <a href="https://doi.org/10.1007/978-3-319-45823-6_90">https://doi.org/10.1007/978-3-319-45823-6_90</a>.'
  ieee: 'P. Kerschke <i>et al.</i>, “Towards Analyzing Multimodality of Multiobjective
    Landscapes,” in <i>Proceedings of the 14$^th$ International Conference on Parallel
    Problem Solving from Nature (PPSN XIV)</i>, 2016, pp. 962–972, doi: <a href="https://doi.org/10.1007/978-3-319-45823-6_90">10.1007/978-3-319-45823-6_90</a>.'
  mla: Kerschke, Pascal, et al. “Towards Analyzing Multimodality of Multiobjective
    Landscapes.” <i>Proceedings of the 14$^th$ International Conference on Parallel
    Problem Solving from Nature (PPSN XIV)</i>, Springer, 2016, pp. 962–972, doi:<a
    href="https://doi.org/10.1007/978-3-319-45823-6_90">10.1007/978-3-319-45823-6_90</a>.
  short: 'P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich,
    in: Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
    from Nature (PPSN XIV), Springer, Edinburgh, Scotland, 2016, pp. 962–972.'
date_created: 2023-08-04T15:16:02Z
date_updated: 2023-10-16T13:39:42Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-45823-6_90
language:
- iso: eng
page: 962–972
place: Edinburgh, Scotland
publication: Proceedings of the 14$^th$ International Conference on Parallel Problem
  Solving from Nature (PPSN XIV)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Towards Analyzing Multimodality of Multiobjective Landscapes
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46367'
abstract:
- lang: eng
  text: When selecting the best suited algorithm for an unknown optimization problem,
    it is useful to possess some a priori knowledge of the problem at hand. In the
    context of single-objective, continuous optimization problems such knowledge can
    be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically
    identifies properties of a landscape, e.g., the so-called funnel structures, based
    on an initial sample. In this paper, we extract the relevant features (for detecting
    funnels) out of a large set of landscape features when only given a small initial
    sample consisting of 50 x D observations, where D is the number of decision space
    dimensions. This is already in the range of the start population sizes of many
    evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used
    for training the classifier, and the approach is then very successfully validated
    on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching
    competition problems.
author:
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Mike
  full_name: Preuss, Mike
  last_name: Preuss
- first_name: Simon
  full_name: Wessing, Simon
  last_name: Wessing
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Kerschke P, Preuss M, Wessing S, Trautmann H. Low-Budget Exploratory Landscape
    Analysis on Multiple Peaks Models. In: <i>Proceedings of the 18$^th$ Annual Conference
    on Genetic and Evolutionary Computation</i>. ; 2016:229–236. doi:<a href="https://doi.org/10.1145/2908812.2908845">10.1145/2908812.2908845</a>'
  apa: Kerschke, P., Preuss, M., Wessing, S., &#38; Trautmann, H. (2016). Low-Budget
    Exploratory Landscape Analysis on Multiple Peaks Models. <i>Proceedings of the
    18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236.
    <a href="https://doi.org/10.1145/2908812.2908845">https://doi.org/10.1145/2908812.2908845</a>
  bibtex: '@inproceedings{Kerschke_Preuss_Wessing_Trautmann_2016, place={Denver, CO,
    USA}, title={Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models},
    DOI={<a href="https://doi.org/10.1145/2908812.2908845">10.1145/2908812.2908845</a>},
    booktitle={Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
    Computation}, author={Kerschke, Pascal and Preuss, Mike and Wessing, Simon and
    Trautmann, Heike}, year={2016}, pages={229–236} }'
  chicago: Kerschke, Pascal, Mike Preuss, Simon Wessing, and Heike Trautmann. “Low-Budget
    Exploratory Landscape Analysis on Multiple Peaks Models.” In <i>Proceedings of
    the 18$^th$ Annual Conference on Genetic and Evolutionary Computation</i>, 229–236.
    Denver, CO, USA, 2016. <a href="https://doi.org/10.1145/2908812.2908845">https://doi.org/10.1145/2908812.2908845</a>.
  ieee: 'P. Kerschke, M. Preuss, S. Wessing, and H. Trautmann, “Low-Budget Exploratory
    Landscape Analysis on Multiple Peaks Models,” in <i>Proceedings of the 18$^th$
    Annual Conference on Genetic and Evolutionary Computation</i>, 2016, pp. 229–236,
    doi: <a href="https://doi.org/10.1145/2908812.2908845">10.1145/2908812.2908845</a>.'
  mla: Kerschke, Pascal, et al. “Low-Budget Exploratory Landscape Analysis on Multiple
    Peaks Models.” <i>Proceedings of the 18$^th$ Annual Conference on Genetic and
    Evolutionary Computation</i>, 2016, pp. 229–236, doi:<a href="https://doi.org/10.1145/2908812.2908845">10.1145/2908812.2908845</a>.
  short: 'P. Kerschke, M. Preuss, S. Wessing, H. Trautmann, in: Proceedings of the
    18$^th$ Annual Conference on Genetic and Evolutionary Computation, Denver, CO,
    USA, 2016, pp. 229–236.'
date_created: 2023-08-04T15:14:06Z
date_updated: 2023-10-16T13:38:47Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2908812.2908845
language:
- iso: eng
page: 229–236
place: Denver, CO, USA
publication: Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
  Computation
publication_identifier:
  isbn:
  - 978-1-4503-4206-3
status: public
title: Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46371'
abstract:
- lang: eng
  text: "One main task in evolutionary multiobjective optimization (EMO) is to obtain
    a suitable finite size approximation of the Pareto front which is the image of
    the solution set, termed the Pareto set, of a given multiobjective optimization
    problem. In the technical literature, the characteristic of the desired approximation
    is commonly expressed by closeness to the Pareto front and a sufficient spread
    of the solutions obtained. In this paper, we first make an effort to show by theoretical
    and empirical findings that the recently proposed Averaged Hausdorff (or Δ\U0001D45D-)
    indicator indeed aims at fulfilling both performance criteria for bi-objective
    optimization problems. In the second part of this paper, standard EMO algorithms
    combined with a specialized archiver and a postprocessing step based on the Δ\U0001D45D
    indicator are introduced which sufficiently approximate the Δ\U0001D45D-optimal
    archives and generate solutions evenly spread along the Pareto front."
author:
- first_name: G
  full_name: Rudolph, G
  last_name: Rudolph
- first_name: O
  full_name: Schütze, O
  last_name: Schütze
- first_name: C
  full_name: Grimme, C
  last_name: Grimme
- first_name: C
  full_name: Domínguez-Medina, C
  last_name: Domínguez-Medina
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged
    Hausdorff archives for bi-objective problems: theoretical and numerical results.
    <i>Computational Optimization and Applications (Comput Optim Appl)</i>. 2016;64(2):589–618.
    doi:<a href="https://doi.org/10.1007/s10589-015-9815-8">10.1007/s10589-015-9815-8</a>'
  apa: 'Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., &#38; Trautmann,
    H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical
    and numerical results. <i>Computational Optimization and Applications (Comput.
    Optim. Appl.)</i>, <i>64</i>(2), 589–618. <a href="https://doi.org/10.1007/s10589-015-9815-8">https://doi.org/10.1007/s10589-015-9815-8</a>'
  bibtex: '@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal
    averaged Hausdorff archives for bi-objective problems: theoretical and numerical
    results}, volume={64}, DOI={<a href="https://doi.org/10.1007/s10589-015-9815-8">10.1007/s10589-015-9815-8</a>},
    number={2}, journal={Computational Optimization and Applications (Comput. Optim.
    Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina,
    C and Trautmann, Heike}, year={2016}, pages={589–618} }'
  chicago: 'Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann.
    “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and
    Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim.
    Appl.)</i> 64, no. 2 (2016): 589–618. <a href="https://doi.org/10.1007/s10589-015-9815-8">https://doi.org/10.1007/s10589-015-9815-8</a>.'
  ieee: 'G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann,
    “Optimal averaged Hausdorff archives for bi-objective problems: theoretical and
    numerical results,” <i>Computational Optimization and Applications (Comput. Optim.
    Appl.)</i>, vol. 64, no. 2, pp. 589–618, 2016, doi: <a href="https://doi.org/10.1007/s10589-015-9815-8">10.1007/s10589-015-9815-8</a>.'
  mla: 'Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective
    Problems: Theoretical and Numerical Results.” <i>Computational Optimization and
    Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, 2016, pp. 589–618, doi:<a
    href="https://doi.org/10.1007/s10589-015-9815-8">10.1007/s10589-015-9815-8</a>.'
  short: G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational
    Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.
date_created: 2023-08-04T15:17:48Z
date_updated: 2023-10-16T13:40:21Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10589-015-9815-8
intvolume: '        64'
issue: '2'
language:
- iso: eng
page: 589–618
publication: Computational Optimization and Applications (Comput. Optim. Appl.)
status: public
title: 'Optimal averaged Hausdorff archives for bi-objective problems: theoretical
  and numerical results'
type: journal_article
user_id: '15504'
volume: 64
year: '2016'
...
---
_id: '46372'
abstract:
- lang: eng
  text: We present a new hybrid evolutionary algorithm for the effective hypervolume
    approximation of the Pareto front of a given differentiable multi-objective optimization
    problem. Starting point for the local search (LS) mechanism is a new division
    of the decision space as we will argue that in each of these regions a different
    LS strategy seems to be most promising. For the LS in two out of the three regions
    we will utilize and adapt the Directed Search method which is capable of steering
    the search into any direction given in objective space and which is thus well
    suited for the problem at hand. We further on integrate the resulting LS mechanism
    into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations.
    Finally, we will present some numerical results on several benchmark problems
    with two and three objectives indicating the strength and competitiveness of the
    novel hybrid.
author:
- first_name: O
  full_name: Schütze, O
  last_name: Schütze
- first_name: Hernandez VA
  full_name: Sosa, Hernandez VA
  last_name: Sosa
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: G
  full_name: Rudolph, G
  last_name: Rudolph
citation:
  ama: Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed
    Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>.
    2016;22(3):273–300. doi:<a href="https://doi.org/10.1007/s10732-016-9310-0">10.1007/s10732-016-9310-0</a>
  apa: Schütze, O., Sosa, H. V., Trautmann, H., &#38; Rudolph, G. (2016). The Hypervolume
    based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal
    of Heuristics</i>, <i>22</i>(3), 273–300. <a href="https://doi.org/10.1007/s10732-016-9310-0">https://doi.org/10.1007/s10732-016-9310-0</a>
  bibtex: '@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based
    Directed Search Method for Multi-Objective Optimization Problems}, volume={22},
    DOI={<a href="https://doi.org/10.1007/s10732-016-9310-0">10.1007/s10732-016-9310-0</a>},
    number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez
    VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }'
  chicago: 'Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume
    Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal
    of Heuristics</i> 22, no. 3 (2016): 273–300. <a href="https://doi.org/10.1007/s10732-016-9310-0">https://doi.org/10.1007/s10732-016-9310-0</a>.'
  ieee: 'O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based
    Directed Search Method for Multi-Objective Optimization Problems,” <i>Journal
    of Heuristics</i>, vol. 22, no. 3, pp. 273–300, 2016, doi: <a href="https://doi.org/10.1007/s10732-016-9310-0">10.1007/s10732-016-9310-0</a>.'
  mla: Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective
    Optimization Problems.” <i>Journal of Heuristics</i>, vol. 22, no. 3, 2016, pp.
    273–300, doi:<a href="https://doi.org/10.1007/s10732-016-9310-0">10.1007/s10732-016-9310-0</a>.
  short: O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22
    (2016) 273–300.
date_created: 2023-08-04T15:19:11Z
date_updated: 2023-10-16T13:40:43Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10732-016-9310-0
intvolume: '        22'
issue: '3'
language:
- iso: eng
page: 273–300
publication: Journal of Heuristics
status: public
title: The Hypervolume based Directed Search Method for Multi-Objective Optimization
  Problems
type: journal_article
user_id: '15504'
volume: 22
year: '2016'
...
---
_id: '46368'
abstract:
- lang: eng
  text: Exploratory Landscape Analysis (ELA) aims at understanding characteristics
    of single-objective continuous (black-box) optimization problems in an automated
    way. Moreover, the approach provides the basis for constructing algorithm selection
    models for unseen problem instances. Recently, it has gained increasing attention
    and numerical features have been designed by various research groups. This paper
    introduces the R-Package FLACCO which makes all relevant features available in
    a unified framework together with efficient helper functions. Moreover, a case
    study which gives perspectives to ELA for multi-objective optimization problems
    is presented.
author:
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis
    with Applications to Multi-Objective Optimization Problems. In: <i>Proceedings
    of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2016. doi:<a href="https://doi.org/10.1109/CEC.2016.7748359">10.1109/CEC.2016.7748359</a>'
  apa: Kerschke, P., &#38; Trautmann, H. (2016). The R-Package FLACCO for Exploratory
    Landscape Analysis with Applications to Multi-Objective Optimization Problems.
    <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. <a
    href="https://doi.org/10.1109/CEC.2016.7748359">https://doi.org/10.1109/CEC.2016.7748359</a>
  bibtex: '@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada},
    title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications
    to Multi-Objective Optimization Problems}, DOI={<a href="https://doi.org/10.1109/CEC.2016.7748359">10.1109/CEC.2016.7748359</a>},
    booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)},
    author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }'
  chicago: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
    Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
    In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>.
    Vancouver, BC, Kanada, 2016. <a href="https://doi.org/10.1109/CEC.2016.7748359">https://doi.org/10.1109/CEC.2016.7748359</a>.
  ieee: 'P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape
    Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi:
    <a href="https://doi.org/10.1109/CEC.2016.7748359">10.1109/CEC.2016.7748359</a>.'
  mla: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
    Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
    <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2016,
    doi:<a href="https://doi.org/10.1109/CEC.2016.7748359">10.1109/CEC.2016.7748359</a>.
  short: 'P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary
    Computation (CEC), Vancouver, BC, Kanada, 2016.'
date_created: 2023-08-04T15:14:52Z
date_updated: 2023-10-16T13:39:06Z
department:
- _id: '34'
- _id: '819'
doi: 10.1109/CEC.2016.7748359
language:
- iso: eng
place: Vancouver, BC, Kanada
publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
status: public
title: The R-Package FLACCO for Exploratory Landscape Analysis with Applications to
  Multi-Objective Optimization Problems
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '11890'
abstract:
- lang: eng
  text: In this paper we study the influence of directional radio patterns of Bluetooth
    low energy (BLE) beacons on smartphone localization accuracy and beacon network
    planning. A two-dimensional model of the power emission characteristic is derived
    from measurements of the radiation pattern of BLE beacons carried out in an RF
    chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived
    for this directional power emission model. With this lower bound on the RMS positioning
    error the coverage of different beacon network configurations can be evaluated.
    For near-optimal network planing an evolutionary optimization algorithm for finding
    the best beacon placement is presented.
author:
- first_name: Joerg
  full_name: Schmalenstroeer, Joerg
  id: '460'
  last_name: Schmalenstroeer
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
citation:
  ama: 'Schmalenstroeer J, Haeb-Umbach R. Investigations into Bluetooth Low Energy
    Localization Precision Limits. In: <i>24th European Signal Processing Conference
    (EUSIPCO 2016)</i>. ; 2016.'
  apa: Schmalenstroeer, J., &#38; Haeb-Umbach, R. (2016). Investigations into Bluetooth
    Low Energy Localization Precision Limits. <i>24th European Signal Processing Conference
    (EUSIPCO 2016)</i>.
  bibtex: '@inproceedings{Schmalenstroeer_Haeb-Umbach_2016, title={Investigations
    into Bluetooth Low Energy Localization Precision Limits}, booktitle={24th European
    Signal Processing Conference (EUSIPCO 2016)}, author={Schmalenstroeer, Joerg and
    Haeb-Umbach, Reinhold}, year={2016} }'
  chicago: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into
    Bluetooth Low Energy Localization Precision Limits.” In <i>24th European Signal
    Processing Conference (EUSIPCO 2016)</i>, 2016.
  ieee: J. Schmalenstroeer and R. Haeb-Umbach, “Investigations into Bluetooth Low
    Energy Localization Precision Limits,” 2016.
  mla: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth
    Low Energy Localization Precision Limits.” <i>24th European Signal Processing
    Conference (EUSIPCO 2016)</i>, 2016.
  short: 'J. Schmalenstroeer, R. Haeb-Umbach, in: 24th European Signal Processing
    Conference (EUSIPCO 2016), 2016.'
date_created: 2019-07-12T05:30:14Z
date_updated: 2023-10-26T08:11:52Z
department:
- _id: '54'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16.pdf
oa: '1'
publication: 24th European Signal Processing Conference (EUSIPCO 2016)
quality_controlled: '1'
related_material:
  link:
  - description: Poster
    relation: supplementary_material
    url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16_Poster.pdf
status: public
title: Investigations into Bluetooth Low Energy Localization Precision Limits
type: conference
user_id: '460'
year: '2016'
...
---
_id: '48873'
abstract:
- lang: eng
  text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP)
    heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful
    in generating satisfactory or even optimal solutions. However, the reasons for
    their success are not yet fully understood. Recent approaches take an analytical
    viewpoint and try to identify instance features, which make an instance hard or
    easy to solve. We contribute to this area by generating instance sets for couples
    of TSP algorithms A and B by maximizing/minimizing their performance difference
    in order to generate instances which are easier to solve for one solver and much
    harder to solve for the other. This instance set offers the potential to identify
    key features which allow to distinguish between the problem hardness classes of
    both algorithms.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Heike
  full_name: Trautmann, Heike
  last_name: Trautmann
citation:
  ama: 'Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences
    of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J,
    eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science.
    Springer International Publishing; 2016:48–59. doi:<a href="https://doi.org/10.1007/978-3-319-50349-3_4">10.1007/978-3-319-50349-3_4</a>'
  apa: Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance
    Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann,
    &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (pp.
    48–59). Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-50349-3_4">https://doi.org/10.1007/978-3-319-50349-3_4</a>
  bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes
    in Computer Science}, title={Evolving Instances for Maximizing Performance Differences
    of State-of-the-Art Inexact TSP Solvers}, DOI={<a href="https://doi.org/10.1007/978-3-319-50349-3_4">10.1007/978-3-319-50349-3_4</a>},
    booktitle={Learning and Intelligent Optimization}, publisher={Springer International
    Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola
    and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing
    Performance Differences of State-of-the-Art Inexact TSP Solvers.” In <i>Learning
    and Intelligent Optimization</i>, edited by Paola Festa, Meinolf Sellmann, and
    Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International
    Publishing, 2016. <a href="https://doi.org/10.1007/978-3-319-50349-3_4">https://doi.org/10.1007/978-3-319-50349-3_4</a>.'
  ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance
    Differences of State-of-the-Art Inexact TSP Solvers,” in <i>Learning and Intelligent
    Optimization</i>, 2016, pp. 48–59, doi: <a href="https://doi.org/10.1007/978-3-319-50349-3_4">10.1007/978-3-319-50349-3_4</a>.'
  mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance
    Differences of State-of-the-Art Inexact TSP Solvers.” <i>Learning and Intelligent
    Optimization</i>, edited by Paola Festa et al., Springer International Publishing,
    2016, pp. 48–59, doi:<a href="https://doi.org/10.1007/978-3-319-50349-3_4">10.1007/978-3-319-50349-3_4</a>.
  short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.),
    Learning and Intelligent Optimization, Springer International Publishing, Cham,
    2016, pp. 48–59.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:05Z
department:
- _id: '819'
doi: 10.1007/978-3-319-50349-3_4
editor:
- first_name: Paola
  full_name: Festa, Paola
  last_name: Festa
- first_name: Meinolf
  full_name: Sellmann, Meinolf
  last_name: Sellmann
- first_name: Joaquin
  full_name: Vanschoren, Joaquin
  last_name: Vanschoren
extern: '1'
keyword:
- Algorithm selection
- Feature selection
- Instance hardness
- TSP
language:
- iso: eng
page: 48–59
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
  isbn:
  - 978-3-319-50349-3
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Evolving Instances for Maximizing Performance Differences of State-of-the-Art
  Inexact TSP Solvers
type: conference
user_id: '102979'
year: '2016'
...