ils-mwis

swMATH41470MaRDI QIDQ5974320FDOQ5974320

Author name not available (Why is that?)

Described by source

• A hybrid iterated local search heuristic for the maximum weight independent set problem

Cited In (7)

• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
• A genetic algorithm for the maximum 2-packing set problem
• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
• Towards faster local search for minimum weight vertex cover on massive graphs
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
• Iterated local search with tabu search for the weighted vertex coloring problem
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches

This page was built for software: ils-mwis