A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
The general Steiner tree-star problem
Information Processing Letters
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Dual-Based Local Search for the Connected Facility Location and Related Problems
INFORMS Journal on Computing
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Journal of Mathematical Modelling and Algorithms
MIP modeling of incremental connected facility location
INOC'11 Proceedings of the 5th international conference on Network optimization
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
INFORMS Journal on Computing
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Computational Optimization and Applications
| Hi-index | 0.00 |
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V,E), a set of customers D ⊆ V, a set of potential facility locations F ⊆ V (including a root r), and a set of Steiner nodes in the graph G = (V,E), a solution (F, T) of ConFL represents a set of open facilities F ⊆ F, such that each customer is assigned to an open facility and the open facilities are connected to the root via a Steiner Tree T. The total cost of the solution (F, T) is the sum of the cost for opening the facilities, the cost of assigning customers to the open facilities and the cost of the Steiner tree that interconnects the facilities. We show how to combine a variable neighborhood search method with a reactive tabu-search, in order to find sub-optimal solutions for large scale instances. We also propose a branch-and-cut approach for solving the ConFL to provable optimality. In our computational study, we test the quality of the proposed hybrid strategy by comparing its values to lower and upper bounds obtained within a branch-and-cut framework.