A metaheuristic algorithm for large maximum weight independent set problems
From MaRDI portal
Cites work
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An exact algorithm for the maximum clique problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Exactly solving the maximum weight independent set problem on large real-world graphs
- Fast local search for the maximum independent set problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP and path relinking for the max-min diversity problem
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Measuring the impact of primal heuristics
- New instances for maximum weight independent set from a vehicle routing application
- On the facial structure of set packing polyhedra
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Paths, Trees, and Flowers
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Reducibility among combinatorial problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
Cited in
(2)
This page was built for publication: A metaheuristic algorithm for large maximum weight independent set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663969)
