Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner and U.~Pferschy, Günther Raidl, R.~Weiskircher
January 2004
PDF Cite
Type
Conference Paper
Evolcomp Hybrid Netdesign
Günther Raidl
Günther Raidl

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