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

The conditional p-center problem in the plane

โœ Scribed by R. Chen; Y. Handler


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
748 KB
Volume
40
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the rectangular p-center problem
โœ Zvi Drezner ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 322 KB

The p-center problem involves finding the best locations for p facilities such that the furthest among n points is as close as possible to one of the facilities. Rectangular (sometimes called rectilinear, Manhattan, or 1,) distances are considered. An O ( n ) algorithm for the 1-center problem, an O

A vertex-closing approach to the p-cente
โœ Joseph S. Martinich ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 980 KB

This article uses a vertex-closing approach to investigate the p-center problem. The optimal set of vertices to close are found in imbedded subgraphs of the original graph. Properties of these subgraphs are presented and then used to characterize the optimal solution, to establish a priori upper and

The sector problem in plane elastostatic
โœ B.S.Ramachandra Rao; C.S. Kale; R.P. Shimpi ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 666 KB
A matching problem in the plane
โœ Mikhail J. Atallah ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 428 KB