The following pages link to (Q3623999):
Displaying 15 items.
- Breakout local search for maximum clique problems (Q339563) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
