Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Modern heuristic techniques for combinatorial problems
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Journal of Algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Size bounds for dynamic monopolies
Discrete Applied Mathematics
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation
Tabu Search
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
The power of small coalitions in graphs
Discrete Applied Mathematics
Path relinking for the vehicle routing problem
Journal of Heuristics
Hi-index | 0.01 |
In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset M@?V. We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positive weights are associated to each vertex of V. In this case, the objective is to find a sandwich graph G in order to maximize the sum of the weights associated to all vertices f-controlled by M. We present a 12-approximation algorithm for the GMCSP and a new procedure for finding feasible solutions based on a linear relaxation. These solutions are then used as starting point in a local search procedure (Tabu Search with Path Relinking) looking for solutions of better quality. Finally, we present some computational results and compare our heuristics with the optimum solution value obtained for some instances of the problem.