Displaying similar documents to “Approximating clustering coefficient and transitivity.”

Variable Neighborhood Search for the File Transfer Scheduling Problem

Dražić, Zorica (2012)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): I.2.8, G.1.6. In this paper a file transfer scheduling problem is considered. This problem is known to be NP-hard, and thus provides a challenging area for metaheuristics. A variable neighborhood search algorithm is designed for the transfer scheduling of files between various nodes of a network, by which the overall transfer times are to be minimized. Optimality of VNS solutions on smaller size instances has been verified by total...