Solving the maximum clique problem using a tabu search approach
From MaRDI portal
Publication:2367014
DOI10.1007/BF02023002zbMATH Open0775.90297MaRDI QIDQ2367014FDOQ2367014
Authors: Michel Gendreau, Patrick Soriano, Louis Salvail 
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Algorithm 457: finding all cliques of an undirected graph
- Optimization by simulated annealing
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Future paths for integer programming and links to artificial intelligence
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Finding a Maximum Clique in an Arbitrary Graph
- Expose-and-merge exploration and the chromatic number of a random graph
- On generating all maximal independent sets
- Cliques in random graphs
- Using tabu search techniques for graph coloring
- A branch and bound algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- Algorithms for maximum independent sets
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Algorithms for the maximum satisfiability problem
- Finding a Maximum Independent Set
- A new heuristic method for the flow shop sequencing problem
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- A global optimization approach for solving the maximum clique problem
- Tabu search techniques. A tutorial and an application to neural networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch and bound algorithm for the maximum clique problem
- Determining the number of internal stability of a graph
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Clique detection for nondirected graphs: Two new algorithms
- Title not available (Why is that?)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- A Survey of Progress in Graph Theory in the Soviet Union
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (37)
- A study of ACO capabilities for solving the maximum clique problem
- The maximum clique problem
- An efficient local search for the feedback vertex set problem
- A variable neighborhood search for graph coloring.
- On biconnected and fragile subgraphs of low diameter
- The life span method -- a new variant of local search
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Detecting robust cliques in graphs subject to uncertain edge failures
- A branch-and-price algorithm for the robust graph coloring problem
- Algorithmic height compression of unordered trees
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Mining relevant information on the Web: a clique-based approach
- Bounds for the frequency assignment problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Algorithms for the maximum \(k\)-club problem in graphs
- Improving heuristics for the frequency assignment problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Facets for node packing
- Constructing a course schedule by solving a series of assignment type problems
- Variable neighborhood search for the maximum clique
- Finding large \(k\)-clubs in undirected graphs
- Solving the anti-covering location problem using Lagrangian relaxation
- Multi-neighborhood tabu search for the maximum weight clique problem
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
- Finding conserved low-diameter subgraphs in social and biological networks
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- A study of diversification strategies for the quadratic assignment problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Metaheuristics: A bibliography
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Genetic algorithms and tabu search: Hybrids for optimization
- A review on algorithms for maximum clique problems
- Heuristics for finding \(k\)-clubs in an undirected graph
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
Uses Software
This page was built for publication: Solving the maximum clique problem using a tabu search approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367014)
