A branch-and-bound algorithm for the minimum cut linear arrangement problem

Palubeckis, Gintaras; Rubliauskas, Dalius

doi:10.1007/s10878-011-9406-2

Cited by 4 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be noted that various implementations of the iterated tabu search method have also been proposed for other optimization problems. Excellent results have been reported in a number of papers, including [ 28 – 34 ]. The tabu search metaheuristic used in ITS is a general-purpose optimization method, based on which specific algorithms for a variety of optimization problems have been developed.…”

Section: Introductionmentioning

confidence: 82%

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Palubeckis

Ostreika

Tomkevičius

2014

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu search (ITS) algorithm for solving this problem. The proposed algorithm incorporates tabu search, local search, and solution perturbation procedures. We report computational results on CPP instances of size up to 2000 vertices. Performance comparisons of ITS against state-of-the-art methods from the literature demonstrate the competitiveness of our approach.

show abstract

Section: Introductionmentioning

confidence: 82%

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Palubeckis

Ostreika

Tomkevičius

2014

The Scientific World Journal

Self Cite

View full text Add to dashboard Cite

show abstract

“…The criteria used for evaluating the performance of the compared B&B algorithms are the same as those used in the literature [14,15]: the total number of partial solutions (ϕ k ) examined during the search process, the total number of backtracking operations occurred and the expended CPU time in seconds. For these criteria smaller values are better.…”

Section: Benchmark Instances and Performance Assessmentmentioning

confidence: 99%

“…This work opens up a range of possibilities for future research. Currently, we are interested in hybridizing our B&B algorithm with some kind of metaheuristic in order to speed the convergence time of the resulting algorithm, inspired in the ideas presented in [15]. The parallelization of the B&B algorithm introduced in this paper also represents an interesting issue for future work.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem

Romero-Monsivais

Rodríguez-Tello

Ramírez

2013

Advances in Computational Intelligence

View full text Add to dashboard Cite

The Cyclic Bandwidth problem (CB) for graphs consists in labeling the vertices of a guest graph G by distinct vertices of a host cycle C (both of order n) in such a way that the maximum distance in the cycle between adjacent vertices in G is minimized. The CB problem arises in application areas like VLSI designs, data structure representations and interconnection networks for parallel computer systems. In this paper a new Branch and Bound (B&B) algorithm for the CB problem is introduced. Its key components were carefully devised after an in-depth analysis of the given problem. The practical effectiveness of this algorithm is shown through extensive experimentation over 20 standard graphs. The results show that the proposed exact algorithm attains the lower bounds for these graphs (of order n ≤ 40) expending a reasonable computational time.

show abstract