Natalia Kliewer

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 Julian Reisch

> Home > Persons > Natalia Kliewer

Publications

2021
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/ReischGPK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/ReischGPK21
Julian Reisch, Peter Großmann, Daniel Pöhle, Natalia Kliewer:
Conflict resolving - A local search algorithm for solving large scale conflict graphs in freight railway timetabling. Eur. J. Oper. Res. 293(3): 1143-1154 (2021)
2020
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/ki/ReischGK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ki/ReischGK20
Julian Reisch, Peter Großmann, Natalia Kliewer:
Stable Resolving - A Randomized Local Search Heuristic for MaxSAT. KI 2020: 163-175
2019
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/or/ReischK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/or/ReischK19
Julian Reisch, Natalia Kliewer:
Black-Box Optimization in Railway Simulations. OR 2019: 717-723
[c16]
- view
  - electronic edition @ aisnet.org
  - no references & citations available
- export record
  dblp key:
  - conf/wirtschaftsinformatik/RosslerRK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wirtschaftsinformatik/RosslerRK19
David Rößler, Julian Reisch, Natalia Kliewer:
Modeling Delay Propagation and Transmission in Railway Networks. Wirtschaftsinformatik 2019: 98-112

a service of

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.