Reverse 1-median Problem with Constraint in Trees

DOI

10.2991/iccasm.2012.19How to use a DOI?

Keywords

Facility location, Tree network, Reverse problem, Minimum cut, Greedy algorithm

Abstract

Different from classical location problem, the reverse problem is how to improve the network as efficient as possible within a given budget when the facilities have already been located in a network and cannot be moved to a new place. This paper concerns the reverse 1-meidan problem with constraint in tree network. It is shown that the model can be divided into two equivalent subproblems. The subproblems will be solved respectively by minimum cut algorithm and greedy algorithm. Finally, an example is set to verify the feasibility of these algorithms.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jianfang Yang
AU  - Juan Jiang
PY  - 2012/08
DA  - 2012/08
TI  - Reverse 1-median Problem with Constraint in Trees
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 75
EP  - 78
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.19
DO  - 10.2991/iccasm.2012.19
ID  - Yang2012/08
ER  -