Stefan Ruzika

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Stephan Helfrich

> Home > Persons > Stefan Ruzika

Publications

2024
[j41]
- view
  authority control:
- export record
  dblp key:
  - journals/jota/HelfrichPR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/HelfrichPR24
Stephan Helfrich, Kathrin Prinz, Stefan Ruzika:
The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems. J. Optim. Theory Appl. 202(3): 1187-1216 (2024)
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/mmor/HelfrichHRT24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/HelfrichHRT24
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. Math. Methods Oper. Res. 100(1): 27-63 (2024)
2023
[j37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgo/HerzelHRT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/HerzelHRT23
Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating biobjective minimization problems using general ordering cones. J. Glob. Optim. 86(2): 393-415 (2023)
[j36]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgo/HelfrichPHBR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/HelfrichPHBR23
Stephan Helfrich, Tyler A. Perini, Pascal Halffmann, Natashia Boland, Stefan Ruzika:
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems. J. Glob. Optim. 86(2): 417-440 (2023)
[i18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-15173
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-15173
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory. CoRR abs/2305.15173 (2023)
2022
[j34]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jco/HelfrichHRT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/HelfrichHRT22
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An approximation algorithm for a general class of multi-parametric optimization problems. J. Comb. Optim. 44(3): 1459-1494 (2022)
2021
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2109-10067
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2109-10067
Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating Biobjective Minimization Problems Using General Ordering Cones. CoRR abs/2109.10067 (2021)
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2109-10076
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2109-10076
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems. CoRR abs/2109.10076 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.