Algorithm 787

swMATH13182MaRDI QIDQ25099FDOQ25099

Author name not available (Why is that?)

Described by source

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

Cited In (9)

• Phased local search for the maximum clique problem
• Title not available (Why is that?)
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Strategies for the parallel implementation of metaheuristics
• Tutorial on surrogate constraint approaches for optimization in graphs
• Title not available (Why is that?)
• On Reducing Maximum Independent Set to Minimum Satisfiability
• A hybrid heuristic for the maximum clique problem
• Probability distribution of solution time in GRASP: an experimental investigation

This page was built for software: Algorithm 787