Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP

ACM Transactions on Mathematical Software

Volumn 24, Issue 4, 1998, Pages 386-394

  Resende, Mauricio G C ^a   Feo, Thomas A ^b   Smith, Stuart H ^c  

^a AT AND T LABS RESEARCH   (United States)

^b Optimization Alternatives   (Canada)

^c ALK Associates   (United States)

Author keywords

D.3.2 Programming Languages : Language classifications Fortran; G.1.6 Numerical Analysis : Optimization integer programming; G.2.1 Discrete Mathematics : Combinatorics combinatorial algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; FORTRAN (PROGRAMMING LANGUAGE); GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP);

SUBROUTINES;

EID: 0032266182     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/293686.293690     Document Type: Article

References (10)

1. ARORA, S., LUND, C., MOTWAN, R., SUDAN, M., AND SZEGEDY, M. 1992. Proof verification and hardness of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. 14-23.
2. BOLLOBÁS, B. 1985. Random Graphs. Academic Press.
3. CARRAGHAN, R., AND PARDALOS, P. 1990. An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375-382.
4. FEO, T. A., AND RESENDE, M. G. 1995. Greedy randomized adaptive search procedures. J Global Opt. 6, 109-133.
5. FEO, T. A., RESENDE, M. G., AND SMITH, S. H. 1994. A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860-878.
6. GAREY, M., AND JOHNSON, D. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
7. JOHNSON, D. S., AND TRICK, M. A., EDS. 1996. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Vol. 26. American Mathematical Society.
8. PARDALOS, P., PITSOULIS, L., AND RESENDE, M. 1995. A parallel GRASP implementation for the quadratic assignment problem. In Parallel Algorithms for Irregularly Structured Problems, A. Ferreira and J. Rolim, Eds. Kluwer Academic Publishers, 111-130.
9. PARDALOS, P., AND XUE, J. 1994. The maximum clique problem. J. Global Opt. 4 301-328.
10. SCHRAGE, L. 1979. A more portable Fortran random number generator. ACM Trans. Math. Softw. 5, 132-138.