Variable neighborhood search for the maximum clique
From MaRDI portal
Publication:705505
DOI10.1016/j.dam.2003.09.012zbMath1058.90053OpenAlexW1998243034MaRDI QIDQ705505
Dragan Urošević, Nenad Mladenović, Pierre Hansen
Publication date: 31 January 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.012
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Subgraph extraction and metaheuristics for the maximum clique problem, A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling, Phased local search for the maximum clique problem, A review on algorithms for maximum clique problems, Variable neighbourhood search for bandwidth reduction, Breakout local search for maximum clique problems, Solving the unconstrained optimization problem by a variable neighborhood search, Extended and discretized formulations for the maximum clique problem, Finding near-optimal independent sets at scale, Algorithms for the maximum \(k\)-club problem in graphs, Reinforcement learning for combinatorial optimization: a survey, Combinatorial algorithms for the maximum \(k\)-plex problem, Learning cluster-based structure to solve constraint satisfaction problems, Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, A simple simulated annealing algorithm for the maximum clique problem, An efficient local search for the feedback vertex set problem, Fast local search for the maximum independent set problem, Cliques with maximum/minimum edge neighborhood and neighborhood density, Variable neighbourhood search: methods and applications, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Variable neighbourhood search: Methods and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Algorithms for the maximum satisfiability problem
- An exact algorithm for the maximum clique problem
- Approximation algorithms for combinatorial problems
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- The maximum clique problem
- Variable neighborhood search
- Metaheuristics: A bibliography
- Solving the maximum clique problem using a tabu search approach
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithms for maximum independent sets
- Tabu Search—Part I
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Optimized Crossover for the Independent Set Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A branch and bound algorithm for the maximum clique problem
- Variable neighborhood search: Principles and applications
- Reactive local search for the maximum clique problem
