A note on convergence in the single facility minisum location problem
β Scribed by J. Brimberg; R. Chen
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 434 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, a finite set in which an optimal solution for a general Euclidean problem of locating an undesirable facility in a polygonal region, is determined and can be found in polynomial time. The general problem we propose leads us, among others, to several well-known problems such as the max
The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the locat