An Algorithm for M Asymmetric  Travelling Salesman Problem on a  Bandwidth-Limited Graph

Dragoš Cvetković; Milan Milosavljević; Vladimir Dimitrijević

Displaying similar documents to “An Algorithm for M Asymmetric Travelling Salesman Problem on a Bandwidth-Limited Graph”

Avoiding Unstructured Workflows in Prerequisites Modeling

Boris Milašinović, Krešimir Fertalj (2012)

Computer Science and Information Systems

Similarity:

Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.

Chen, Hon-Chan (2004)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem

Milanović, Marija (2010)

Mathematica Balkanica New Series

Similarity:

AMS Subj. Classiﬁcation: 90C27, 05C85, 90C59 The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the ﬁrst problems shown to be NP-hard. The deﬁnition of the GVCP and basics of genetic algorithms are described. Details of genetic algorithm and numerical results are presented in [8]. Genetic algorithm obtained high quality solutions in...

A comparison of three algorithms for reducing the profile of a sparse matrix

Alain Billionnet, Jean-François Brêteau (1989)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Randomly Eulerian digraphs

Gary Chartrand, Don R. Lick (1971)

Czechoslovak Mathematical Journal

Similarity:

Every connected acyclic digraph of height 1 is neighbourhood-realizable

Bohdan Zelinka (1991)

Archivum Mathematicum

Similarity:

On the Vertex Separation of Cactus Graphs

Markov, Minko (2007)

Serdica Journal of Computing

Similarity:

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.