Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/4602
Title: | The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance |
Authors: | Nguyễn, Trung Kiên Chassein, André |
Keywords: | Ordered median Inverse optimization problem Convex Tree Chebyshev norm Hamming distance |
Issue Date: | 2015 |
Series/Report no.: | European Journal of Operational Research;247 .- p.774-781 |
Abstract: | We investigate the inverse convex ordered 1-median problem on unweighted trees under the cost functions related to the Chebyshev norm and the Hamming distance. By the special structure of the problem under Chebyshev norm, we deduce the so-calledmaximum modification to modify the edge lengths of the tree. Additionally, the cost function of the problem receives only finite values under the bottleneck Hamming distance. Therefore, we can find the optimal cost of the problem by applying binary search. It is shown that both of the problems, under Chebyshev norm and under the bottleneck Hamming distance, can be solved in O(n²log n) time in all situations, with or without essential topology changes. Here, n is the number of vertices of the tree. Finally, we prove that the problem under weighted sum Hamming distance is NP-hard. |
URI: | http://dspace.ctu.edu.vn/jspui/handle/123456789/4602 |
Appears in Collections: | Tạp chí quốc tế |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ | 543.4 kB | Adobe PDF | View/Open | |
Your IP: 18.116.118.244 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.