A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Giải bài toán k-median nhờ quy hoạch lõm
2016
Journal of Computer Science and Cybernetics
GIAI BAI TOAN k-MEDIAN NHO· QUI HOACH LOM! . 'X , 1::, -NGUYEN TRQNG TOAN, NGUYEN Due NGHIA Abstract. The k-median problem sons its of llocating 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 branchand-bound algorithm for the problem is proposed. Its computational experience is also presented in order to compare it with other methods. 13. V. J.
doi:10.15625/1813-9663/13/4/8036
fatcat:dbpeqooe4ndkpbk2kln6kr33de