2008 | ||
---|---|---|
2 | EE | Martin Gruber, Günther R. Raidl: Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. SAINT 2008: 261-264 |
2006 | ||
1 | EE | Martin Gruber, Jano I. van Hemert, Günther R. Raidl: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. GECCO 2006: 1187-1194 |
1 | Jano I. van Hemert | [1] |
2 | Günther R. Raidl | [1] [2] |