Complexity results for the p-median problem with mutual communication
Year of publication: |
1993
|
---|---|
Authors: | Tamir, A. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 14.1993, 2, p. 79-84
|
Saved in:
Saved in favorites
Similar items by person
-
Polynomially Bounded Algorithms for Locating p-Centres on a Tree
Chandrasekaran, R., (1978)
-
An O((n lOg p)2) Algorithm for the Continous P-Center Problem on a Tree
Chandrasekaran, R., (1979)
-
On the Complexity of Point Covering and Line Covering
Meggido, N., (1981)
- More ...