Displaying similar documents to “A new algorithm for finding minimal cycle-breaking sets of turns in a graph.”

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...

A method of constructing the frame of a directed graph

Ichiro Hofuku, Kunio Oshima (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of...

On improving a solution to the ATSP with fixed origin and precedence relationships.

Laureano F. Escudero (1988)

Trabajos de Investigación Operativa

Similarity:

Given the directed graph G = (N, A) with a node origin and a penalty matrix C, the ATSP with fixed origin and precedence relationships (hereafter, ASTP-PR) consists of finding the permutation of the nodes from the set N, such that it minimizes a matrix C based function and does not violate the precedence relationships given by the set A. In this work we present an algorithm for improving a given feasible solution to the problem, by performing a local search that uses 3- and 4-change...