General connected facility location (GConFL): Bardossy and Rahavan [5] develop a dual-based local search (DLS) heuristic for a family of problems combining facility location decisions with connectivity requirements, namely the (general) Steiner tree-star, ConFL and RoB.
Quick summary: We give dirt-simple and easy-to-analyze randomized algorithms that improve the best-known approximation ratios for connected facility location, virtual private network design, and single-sink buy-at-bulk network design.
We present cost sharing methods for connected facility location games that are cross-monotonic and competitive and that recover a constant fraction of the cost of the constructed solution.
You may not be able to control the way employees approach or manage your energy conservation initiatives, but a connected facility can provide owners with new and creative methods of encouragement.
For example, we reduce the approximation ratio for the connected facility location problem from 8.55 to 4.00 and for the single-sink rent-or-buy problem from 3.55 to 2.92.
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL).
The optimization problem is then formulated as an integer linear program, and the problem is the same as a special case of the connected facility location problem, which is known to be NP-hard.
We consider generalizations of the connected facility location problem, where clients connect to open facilities via access trees that are shared by multiple clients.
We also provide a primal-dual cost sharing method for the connected facility location game with opening costs.
The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree.
Similar to the connected facility location problem, the passive optical network design problem requires the search for a subset of deployed distribution points (splitters) as well as an allocation of demand points (optical network units) to minimise deployment cost.
