دورية أكاديمية

On the Vector Assignment p-Median Problem.

التفاصيل البيبلوغرافية
العنوان: On the Vector Assignment p-Median Problem.
المؤلفون: Hooker, J. N., Garfinkel, R. S.
المصدر: Transportation Science; May89, Vol. 23 Issue 2, p139, 2p
مصطلحات موضوعية: VECTOR analysis, LINEAR programming, MATHEMATICS, MEDIAN (Mathematics), STATISTICS, STANDARD deviations, TRANSPORTATION
مستخلص: The vector assignment p-median problem allows nodes of a network to be served by a nonclosest facility. We present a counterexample to a proposition of J. R. Weaver and R. L. Church that an all-node solution always exists. We show that the proposition is true, however, if every node is served by closer facilities at least as often as by more distant facilities. [ABSTRACT FROM AUTHOR]
Copyright of Transportation Science is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
قاعدة البيانات: Complementary Index
الوصف
تدمد:00411655
DOI:10.1287/trsc.23.2.139