On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks |
| |
Authors: | Kien Trung Nguyen Huong Nguyen-Thu Nguyen Thanh Hung |
| |
Institution: | 1.Mathematics Department, Teacher College,Can Tho University,Can Tho,Vietnam |
| |
Abstract: | An ordered median function is used in location theory to generalize a class of problems, including median and center problems. In this paper we consider the complexity of inverse ordered 1-median problems on the plane and on trees, where the multipliers are sorted nondecreasingly. Based on the convexity of the objective function, we prove that the problems with variable weights or variable coordinates on the line are NP-hard. Then we can directly get the NP-hardness result for the corresponding problem on the plane. We finally develop a cubic time algorithm that solves the inverse convex ordered 1-median problem on trees with relaxation on modification bounds. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|