๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An approximation algorithm for the -Level Concentrator Location Problem

โœ Scribed by Moritz A. Drexl

Book ID
113834553
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
241 KB
Volume
39
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for the -leve
An approximation algorithm for the -level stochastic facility location problem
โœ Zhen Wang; Donglei Du; Adriana F. Gabor; Dachuan Xu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.

Lagrangian relaxation for the star-star
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
โœ Andranik Mirzaian ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 673 KB

The star-star concentrator location problem (SSCLP), which is a network layout problem, is considered. SSCLP is formulated as an integer linear programming problem. The Lagrangian relaxation (LR) method is used to obtain suboptimal solutions (upper bounds) and lower bounds. Three different LRs are u