A metaheuristic algorithm for large maximum weight independent set problems
From MaRDI portal
Publication:6663969
DOI10.1002/net.22247MaRDI QIDQ6663969
Andrew V. Goldberg, Mauricio G. C. Resende, Nikos Parotsidis, Yuanyuan Dong, Alexander Noe, Quico Spaen
Publication date: 15 January 2025
Published in: Networks (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Fast local search for the maximum independent set problem
- An exact algorithm for the maximum clique problem
- GRASP and path relinking for the max-min diversity problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- A probabilistic heuristic for a computationally difficult set covering problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- Greedy randomized adaptive search procedures
- New instances for maximum weight independent set from a vehicle routing application
- Measuring the impact of primal heuristics
- Optimization by GRASP
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Reducibility among Combinatorial Problems
- On the facial structure of set packing polyhedra
- Fibonacci heaps and their uses in improved network optimization algorithms
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
- Paths, Trees, and Flowers
This page was built for publication: A metaheuristic algorithm for large maximum weight independent set problems
