Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP

Authors:
Mauricio G. C. Resende;Thomas A. Feo;Stuart H. Smith
Affiliations:
AT&T Labs Research;Optimization Alternatives;ALK Associates, Inc.
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1998

Citing 2
Cited 5

A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

Journal of Heuristics
Dynamic local search for the maximum clique problem

Journal of Artificial Intelligence Research
Cooperating local search for the maximum clique problem

Journal of Heuristics
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G=(V, E) be an undirected graph where V and E are the sets of vertices and edges of G, respectively. A subset of the vertices S⊆ V is independent if all of its members are pairwise nonadjacent, i.e., have no edge between them. A solution to the NP-hard maximum independent set problem is an independent set of maximum cardinality. This article describes gmis, a set of Fortran subroutines to find an approximate solution of a maximum independent set problem. A greedy randomized adaptive search procedure (GRASP) is used to produce the solutions. The algorithm is described in detail. Implementation and usage of the package is outlined, and computational experiments are reported, illustrating solution quality as a function of running time.