Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control

Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.