Ann-Kathrin Rothenbächer

According to our database, Ann-Kathrin Rothenbächer authored at least 6 papers between 2016 and 2019.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2019

Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures.

Ann-Kathrin Rothenbächer

Transp. Sci., 2019

2018

Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows.

Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich

Transp. Sci., 2018

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.

Timo Gschwind, Stefan Irnich, Ann-Kathrin Rothenbächer, Christian Tilk

Eur. J. Oper. Res., 2018

Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems.

Ann-Kathrin Rothenbächer

Proceedings of the Operations Research Proceedings 2018, 2018

2017

Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.

Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, Stefan Irnich

Eur. J. Oper. Res., 2017

2016

Branch-and-price-and-cut for a service network design and hub location problem.

Ann-Kathrin Rothenbächer, Michael Drexl, Stefan Irnich

Eur. J. Oper. Res., 2016