Stefan Irnich

Full Professor of Logistics Management

Johannes Gutenberg Universität Mainz

Germany

Research Interests

Explore related searches

Professors in Germany

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Articles (13)

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Collaborators (4)

Timo Gschwind

RPTU Kaiserslautern-Landau

GERMANY

View details

Christian Tilk

Universität Wien

AUSTRIA

View details

Ulrich Pferschy

Graz University of Technology

AUSTRIA

View details

Fabio Furini

Sapienza University of Rome

ITALY

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Stefan Irnich

Research Interests

Explore related searches

Contact this professor

Articles (13)

Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies

Exact Solution of the Single-Picker Routing Problem with Scattered Storage

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems

Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model

Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

Using public transport in a 2-echelon last-mile delivery network

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system

A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing

New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem

The last-mile vehicle routing problem with delivery options

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem

Collaborators (4)

Timo Gschwind

Christian Tilk

Ulrich Pferschy

Fabio Furini

Make your next move.

Stefan Irnich

Research Interests

Explore related searches

Contact this professor

Articles (13)

﻿Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff

The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies

Exact Solution of the Single-Picker Routing Problem with Scattered Storage

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems

Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model

Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

Using public transport in a 2-echelon last-mile delivery network

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system

A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing

New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem

The last-mile vehicle routing problem with delivery options

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem

Collaborators (4)

Timo Gschwind

Christian Tilk

Ulrich Pferschy

Fabio Furini

Make your next move.

Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff