Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Dorothee Henke

> Home > Persons

Person information

affiliation: Universität Passau, Germany
affiliation (former): TU Dortmund, Germany

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2024
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/AhrensHRV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/AhrensHRV24
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. 206(1): 3-32 (2024)
2022
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgo/BuchheimH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/BuchheimH22
Christoph Buchheim, Dorothee Henke:
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. J. Glob. Optim. 83(4): 803-824 (2022)
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jota/BuchheimHI22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/BuchheimHI22
Christoph Buchheim, Dorothee Henke, Jannik Irmai:
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. J. Optim. Theory Appl. 194(2): 521-542 (2022)
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/networks/BuchheimHH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BuchheimHH22
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022)
2021
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/BuchheimHH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/BuchheimHH21
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49(5): 703-707 (2021)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2022
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/AhrensHRV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/AhrensHRV22
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. IPCO 2022: 15-28

Informal and Other Publications

see FAQ

What is the meaning of the colors in the publication lists?

2024
[i7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2401-03951
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2401-03951
Dorothee Henke:
The Robust Bilevel Selection Problem. CoRR abs/2401.03951 (2024)
2022
[i6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/BrotcorneBHH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/BrotcorneBHH22
Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke:
Optimization at the Second Level (Dagstuhl Seminar 22441). Dagstuhl Reports 12(10): 207-224 (2022)
2021
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2105-08378
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2105-08378
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR abs/2105.08378 (2021)
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2108-12303
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2108-12303
Christoph Buchheim, Dorothee Henke, Jannik Irmai:
The stochastic bilevel continuous knapsack problem with uncertain follower's objective. CoRR abs/2108.12303 (2021)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2111-06169
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2111-06169
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen:
Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. CoRR abs/2111.06169 (2021)
2020
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2012-12770
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2012-12770
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR abs/2012.12770 (2020)
2019
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1903-02810
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1903-02810
Christoph Buchheim, Dorothee Henke:
The robust bilevel continuous knapsack problem. CoRR abs/1903.02810 (2019)

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.