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; U. Pferschy; G. Raidl; R. Weiskircher

by G.W. Klau, I. Ljubić, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. Weiskircher

Reference:

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree ProblemG.W. Klau, I. Ljubić, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. WeiskircherGenetic and Evolutionary Computation – GECCO 2004 (K. Deb, others, eds.), volume 3102 of LNCS, pages 1304–1315, 2004, Springer.

Bibtex Entry:

@INPROCEEDINGS{klau:04,
author = {G.W.~Klau and I.~Ljubić and A.~Moser and P.~Mutzel and P.~Neuner
and U.~Pferschy and G.~Raidl and R.~Weiskircher},
title = {Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting {S}teiner Tree Problem},
editor = {K.~ Deb and others},
booktitle =  {Genetic and Evolutionary Computation -- GECCO 2004},
series = {LNCS},
volume = {3102},
publisher = {Springer},
year = {2004},
pages = {1304--1315},
url = {https://www.ac.tuwien.ac.at/files/pub/klau-04.pdf},
keywords = {evolcomp,netdesign,hybrid}
}