haku: @author Hochbaum, D. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Hochbaum, D. Pathria, A. |
| Otsikko: | Ceneralized p-Center problems: Complexity results and approximation algorithms |
| Lehti: | European Journal of Operational Research
1997 : AUG 1, VOL. 100:3, p. 594-607 |
| Asiasana: | OPERATIONAL RESEARCH ALGORITHMS ECONOMICS |
| Kieli: | eng |
| Tiivistelmä: | In an earlier paper, two alternative p-Center problems, where the centers serving customers must be chosen so that exactly one node from each of p prespecified disjoint pairs of nodes is selected, were shown to be NP-complete. this paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the number of servers selected from each set must be within a prespecified range. |
« edellinen | seuraava »
SCIMA