A hybrid iterated local search heuristic for the maximum weight independent set problem
From MaRDI portal
Publication:1749784
Recommendations
- A new heuristic algorithm to solve the maximum independent set problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- A branch-and-price approach for the maximum weight independent set problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Genetic algorithmic approach to find the maximum weight independent set of a graph
Cites work
- A branch-and-price approach for the maximum weight independent set problem
- A fast algorithm for the maximum weight clique problem
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Approximating the maximum vertex/edge weighted clique using local search
- Breakout local search for maximum clique problems
- Efficient algorithms for cluster editing
- Fast local search for the maximum independent set problem
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- Multi-neighborhood tabu search for the maximum weight clique problem
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Reducibility among combinatorial problems
- Solving the maximum vertex weight clique problem via binary quadratic programming
Cited in
(24)- A new heuristic algorithm to solve the maximum independent set problem
- A genetic algorithm for the maximum 2-packing set problem
- On solving the time window assignment vehicle routing problem via iterated local search
- Towards faster local search for minimum weight vertex cover on massive graphs
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- Iterated local search with tabu search for the weighted vertex coloring problem
- scientific article; zbMATH DE number 4064507 (Why is no real title available?)
- A branch-and-price approach for the maximum weight independent set problem
- ils-mwis
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
- A metaheuristic algorithm for large maximum weight independent set problems
- The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
- Iterated local search, iterated greedy and applications
- A local search algorithm for large maximum weight independent set problems
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
- Finding 3-swap-optimal independent sets and dominating sets is hard
- Finding near-optimal weight independent sets at scale
- Scalable algorithms for 2-packing sets on arbitrary graphs
- Jumping particle swarm-based local search approach for the maximum weighted independent set problem
- Finding maximum weight 2-packing sets on arbitrary graphs
- Solving the set packing problem via a maximum weighted independent set heuristic
This page was built for publication: A hybrid iterated local search heuristic for the maximum weight independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749784)
