An iterated-tabu-search heuristic for a variant of the partial set covering problem

Nehme, Bilal; Galinier, P.; Guibault, François

doi:10.1007/s10732-013-9235-9

Cited by 17 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

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: 81%

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Palubeckis

Ostreika

Tomkevičius

2014

The Scientific World Journal

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: 81%

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Palubeckis

Ostreika

Tomkevičius

2014

The Scientific World Journal

View full text Add to dashboard Cite

show abstract

“…considering the alternative formulation. In Bilal et al [60], they solved an SCP variant through an iterated tabu-search metaheuristic. In Crawford et al [61], they compared the results obtained solving the traditional and alternative formulations through the ACO algorithm.…”

Section: Related Workmentioning

confidence: 99%

Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem

Lanza-Gutiérrez

Caballé

Crawford

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The set covering problem (SCP) is an NP-complete optimization problem, fitting with many problems in engineering. The traditional SCP formulation does not directly address both solution unsatisfiability and set redundancy aspects. As a result, the solving methods have to control these aspects to avoid getting unfeasible and nonoptimized in cost solutions. In the last years, an alternative SCP formulation was proposed, directly covering both aspects. This alternative formulation received limited attention because managing both aspects is considered straightforward at this time. This paper questions whether there is some advantage in the alternative formulation, beyond addressing the two issues. Thus, two studies based on a metaheuristic approach are proposed to identify if there is any concept in the alternative formulation, which could be considered for enhancing a solving method considering the traditional SCP formulation. As a result, the authors conclude that there are concepts from the alternative formulation, which could be applied for guiding the search process and for designing heuristic feasibilit\y operators. Thus, such concepts could be recommended for designing state-of-the-art algorithms addressing the traditional SCP formulation.

show abstract

“…To solve highly constrained covering problems relaxed approaches can be adopted, such as the partial set covering (Bilal et al 2014), where it is not necessary to cover all the elements.…”

Section: Set Partition and Set Covering Problemmentioning

confidence: 99%

A data reduction approach using hypergraphs to visualize communities and brokers in social networks

Cavique

Marques

Gonçalves

2018

Soc. Netw. Anal. Min.

View full text Add to dashboard Cite

The comprehension of social network phenomena is closely related to data visualization. However, even with only hundreds of nodes, the visualization of dense networks is usually difficult. The strategy adopted in this work is data reduction using communities. Community detection in social network analysis is a very important issue and in particular detection of community overlapping. In this approach, the information extracted from social networks transcends cohesive groups, enabling the discovery of brokers that interact among communities. In order to find admissible solutions in hard problems, relaxed approaches are used. Quasi-cliques are generated, and partition is found using a partial set covering heuristic. The proposed method allows the identification of communities and actors that link two or more groups. In the visualization process, the user can choose different dimension reduction approaches for the condensed graph. For each condensed structure a hypergraph can be drawn, identifying communities and brokers.

show abstract

An iterated-tabu-search heuristic for a variant of the partial set covering problem

Cited by 17 publications

References 22 publications

An Iterated Tabu Search Approach for the Clique Partitioning Problem

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem

A data reduction approach using hypergraphs to visualize communities and brokers in social networks

Contact Info

Product

Resources

About