Location problems with grouped structure of demand: Complexity and algorithms
✍ Scribed by Averbakh, Igor; Berman, Oded
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 162 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
We study generalizations of classical multifacility location problems, where customers' demand has a hierarchial structure, i.e., the set of local customers is partitioned into categories (global customers), each having its own requirements for quality of service. For the case of identical facilities, we prove that the categorized coverage, covering, p-center, and p-median problems are strongly NPhard on trees, in contrast with their classical noncategorized versions (which are polynomially solvable on trees). Some of the problems are shown to be NP-hard even on paths. For the case of distinguishable facilities, we provide polynomial and strongly polynomial algorithms for the categorized covering, multicenter, and multimedian problems with mutual communication on a tree.
📜 SIMILAR VOLUMES
## Abstract Diethyl [1′‐(diphenylphosphanyl)ferrocenyl]phosphonate (1) was synthesised by stepwise metallation/functionalisation of 1,1′‐dibromoferrocene and studied as a ligand for palladium(II) and group‐12 metals. Treatment of [PdCl~2~(cod)] (cod = η^2^:η^2^‐cycloocta‐1,5‐diene) with 1 in 1:1 or
Lithium bis(N,N-dimethyl-2-aminoethyl)amide (1 a) and lithium N-methyl-N- (3,6-diaza-3,6-dimethyl)heptylamide (2) are dimers in toluene, THF and in the crystalline state where they exhibit diamond-shaped Li 2 N 2 cores. Tetracoordination of lithium is achieved by intramolecular binding of the amine