The following pages link to (Q3623999):
Displaying 40 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)
- Variable neighborhood search for the maximum clique (Q705505) (← 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)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← 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)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← 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)
- Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary) (Q1936664) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Distributed Load Identification for Uncertain Structure Based on LHS-GA and Improved L-Curve Method (Q4987337) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- Reactive local search for the maximum clique problem (Q5943666) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
