Stabilized branch-and-price algorithms for vector packing problems. - Katrin Heßler; Timo Gschwind; Stefan Irnich (Eur. J. Oper. Res., 2018)

A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. - Katrin Heßler; Stefan Irnich (Discret. Appl. Math., 2021)

Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes. - Katrin Heßler (Eur. J. Oper. Res., 2021)

A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing. - Katrin Heßler; Stefan Irnich (Oper. Res. Lett., 2022)

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. - Katrin Heßler; Stefan Irnich; Tobias Kreiter; Ulrich Pferschy (OR Spectr., 2022)

Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem. - Katrin Heßler; Stefan Irnich (INFORMS J. Comput., 2023)

Exact Solution of the Single-Picker Routing Problem with Scattered Storage. - Katrin Heßler; Stefan Irnich (INFORMS J. Comput., 2024)

The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies. - Laura Lüke; Katrin Heßler; Stefan Irnich (OR Spectr., 2024)