Some reverse location problems

被引：78

作者：

Zhang, JZ

Liu, ZH

Ma, ZF

机构：

[1] City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China

[2] Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 124卷 / 01期

关键词：

facility location; tree network; minmax criterion; minimum cut;

D O I：

10.1016/S0377-2217(99)00122-8

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

The general location problem in a network is to find locations of facilities in a given network such that the total cost is minimum. It is very often to have its reverse case, in which the facilities have already been located on the network, and the problem is how to improve the network within a given budget so that the improved network is as efficient as possible. In this paper we present a strongly polynomial algorithm for a reverse location problem in tree networks. The method can be extended to solve reverse two- or more-location problems. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：77 / 88

页数：12

共 21 条

[1]

Ahuja R.K., 1993, NETWORK FLOWS THEORY

[2]

IMPROVING THE LOCATION OF MINIMAX FACILITIES THROUGH NETWORK MODIFICATION [J].