Algorithm 787

MaRDI QIDQ25099swMATHFDO

Official website http://dl.acm.org/citation.cfm?doid=293686.293690

Described by source

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

Cited in

(14)

• Phased local search for the maximum clique problem
• scientific article; zbMATH DE number 1424314 (Why is no real title available?)
• On reducing maximum independent set to minimum satisfiability
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Tutorial on surrogate constraint approaches for optimization in graphs
• Strategies for the parallel implementation of metaheuristics
• GRASP
• GRASP_QAP
• QUALEX
• Algorithm 797
• Algorithm 769
• scientific article; zbMATH DE number 5547826 (Why is no real title available?)
• 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