Giải bài toán k-median nhờ quy hoạch lõm

Nguyễn Trọng Toàn, Nguyễn Đức Nghĩa

Abstract


The k-median problem sonsits of locating k facilities on a network of n nodes, so that sum of shortest distances from each of the nodes of the network to ist nearest facilities is minimized. Based on the reasonable evaluation of bounds, a branch and bound algorithm for the problem is proposed. Its computational experience is also presented in order to compare it with other methods.


Refbacks

  • There are currently no refbacks.


Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology