Dec 6, 2020 · This paper investigates the inverse 1-median and 1-center location problems on trees under -norm in order to fill the gap of the problems under various norms.
We consider in this paper the inverse versions of the two popular problems in location theory, say the 1-median and the 1-center problems on trees.
Jun 12, 2020 · Computational aspects of the inverse single facility location problem on trees under lk-norm. Volume : 844. Van, Le Huynh My | Nguyen, Kien ...
Computational aspects of the inverse single facility location problem on trees under lk-norm. KT Nguyen, NT Hung. Theoretical Computer Science 844, 133-141 ...
Computational aspects of the inverse single facility location problem on trees under lk-norm. KT Nguyen, NT Hung. Theoretical Computer Science 844, 133-141.
Computational aspects of the inverse single facility location problem on trees under l k -norm. Authors. Le Huynh My Van · Kien Trung Nguyen · Nguyen Thanh Hung ...
In this paper, we consider the inverse of this single facility location problem on a tree, i.e. by modifying the lengths of edges with minimum total cost the ...
Missing: aspects lk-
The problem consists in modifying the lower and upper bounds of a given feasible flow f in a network G so that the given flow becomes a maximum flow in G ...
Computational aspects of the inverse single facility location problem on trees under lk-norm. KT Nguyen, NT Hung. Theoretical Computer Science 844, 133-141.
Computational aspects of the inverse single facility location problem on trees under lk-norm · L. VanK. NguyenN. T. Hung. Mathematics, Computer Science. Theor ...