Talks and Poster Presentations (with Proceedings-Entry):

M. Leitner, G. Raidl:
"Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", Volume 6927 (2011), ISBN: 978-3-642-27548-7; 295 - 302.

English abstract:
The Connected Facility Location problem combining facility
location and Steiner trees has recently gained stronger scientific interest
as it can be used to model the extension of last mile communication
networks in so-called fiber-to-the-curb scenarios. We consider a generalization
of this problem which considers capacity constraints on potential
facilities and aims at maximizing the resulting profit by potentially supplying
only a subset of all customers. In this work, we discuss two metaheuristic
approaches for this problem based on variable neighborhood
search and greedy randomized adaptive search. Computational results
show that both approaches allow for computing high quality solutions in
relatively short time.

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.