Pages that link to "Item:Q705505"
From MaRDI portal
The following pages link to Variable neighborhood search for the maximum clique (Q705505):
Displaying 22 items.
- Breakout local search for maximum clique problems (Q339563) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Learning cluster-based structure to solve constraint satisfaction problems (Q647439) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling (Q3163193) (← links)