The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Type
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Günther Raidl is a Professor at the Algorithms and Complexity Group.