 The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distanceKien Trung Nguyen and André Chassein European Journal of Operational Research, 2015, vol. 247, issue 3, 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-called maximum 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(n2log 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. Keywords: Ordered median; Inverse optimization problem; Convex; Tree; Chebyshev norm; Hamming distance (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:247:y:2015:i:3:p:774-781 DOI: 10.1016/j.ejor.2015.06.064 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.