Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther Raidl, Rene Weiskircher  Home/Search
Context Related
| ads.tuwien.ac.at/~...STmemetic:2004.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: ads.tuwien.ac.at/~gunnar/ (more) Homepages: G.Klau |
Rate this article:      (best)Comment on this article |
Abstract: The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total profit of all vertices not contained in the subtree. For this well-known problem we develop a new algorithmic framework consisting of three main parts: (1) An extensive preprocessing phase reduces the given graph without changing the structure of the optimal solution. (2) The central part of our approach is a... (Update)
Cited by: More
Combining Metaheuristics and Exact Algorithms - In Combinatorial Optimization (Correct)
Solving the Prize-Collecting Steiner Tree Problem - Lubic, al. (2004) (Correct)
Active bibliography (related documents): More All
2.4: Combining a Memetic Algorithm with Integer.. - Klau, Ljubic.. (2004) (Correct)
0.6: The Fractional Prize-Collecting Steiner Tree.. - Klau, Ljubic.. (2003) (Correct)
0.4: The Prize Collecting Steiner Tree Problem - Minkoff (1998) (Correct)
Similar documents based on text: More All
0.4: The Fractional Prize-Collecting Steiner Tree Problem.. - Klau, Ljubic, Mutzel, .. (2003) (Correct)
0.4: Automatic Layout and Labelling of State Diagrams - Klau, Mutzel (Correct)
0.4: An Experimental Comparison of Orthogonal Compaction Algorithms - Klau, Klein, Mutzel (2000) (Correct)
BibTeX entry: (Update)
G.W. Klau, I. Ljubi c, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, and R. Weiskircher. Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. In K. Deb, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), LNCS. Springer-Verlag, 2004. to appear. http://citeseer.ist.psu.edu/article/klau04combining.html More
@inproceedings{ klau04combining,
author = "G. Klau and I. Ljubi\'c and A. Moser and P. Mutzel and P. Neuner and U. Pferschy
and R. Weiskircher",
title = "Combining a memetic algorithm with integer programming to solve the prize-collecting
Steiner tree problem",
editor = "K. Deb",
booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004)",
series = "LNCS",
publisher = "Springer-Verlag",
year = "2004",
url = "citeseer.ist.psu.edu/article/klau04combining.html" }
Citations (may not include all citations):65 The primal-dual method for approximation algorithms and its .. (context) - Goemans, Williamson - 1996
36 Memetic algorithms: A short introduction (context) - Moscato - 1999
27 A note on the prize collecting traveling salesman problem (context) - Bienstock, Goemans et al. - 1993
23 The prize-collecting Steiner tree problem: Theory and practi.. - Johnson, Minko et al. - 2000
18 Local search with perturbations for the prize-collecting Ste.. (context) - Canuto, Resende et al. - 2001
18 The Steiner tree polytope and related polyhedra (context) - Goemans - 1994
14 The node-weighted Steiner tree problem (context) - Segev - 1987
13 Some generalizations of the Steiner problem in graphs (context) - Duin, Volgenant - 1987
8 A faster approximation for the Steiner problem in graphs (context) - Mehlhorn - 1988
8 Facets of two Steiner arborescence polyhedra (context) - Fischetti - 1991
5 ective evolutionary coding of spanning trees (context) - Raidl, Julstrom et al. - 2003
4 Strong lower bounds for the prize-collecting Steiner problem.. - Lucena, Resende - 2000
4 The fractional prize-collecting Steiner tree problem on tree.. - Klau, Ljubic et al. - 2003
3 the importance of phenotypic duplicate elimination in decode.. (context) - Raidl, Gottlieb - 1999
3 A strong lower bound for the node weighted Steiner tree prob.. (context) - Engevall, Gothe-Lundgren et al. - 1998
2 A new lower bounding procedure for the prize-collecting Stei.. (context) - Klau, Ljubic et al. - 2004
Documents on the same site (http://www.ads.tuwien.ac.at/~gunnar/): More
Optimal Labeling of Point Features in Rectangular Labeling Models - Klau, Mutzel (2002) (Correct)
The Fractional Prize-Collecting Steiner Tree.. - Klau, Ljubic.. (2003) (Correct)
AGD: A Library of Algorithms for Graph Drawing - Jünger, Klau, Mutzel.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC