Solving the maximum clique problem using a tabu search approach
From MaRDI portal
Publication:2367014
DOI10.1007/BF02023002zbMath0775.90297MaRDI QIDQ2367014
Louis Salvail, Patrick Soriano, Michel Gendreau
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)
Related Items
A study of diversification strategies for the quadratic assignment problem, Genetic algorithms and tabu search: Hybrids for optimization, A review on algorithms for maximum clique problems, Algorithmic height compression of unordered trees, Detecting robust cliques in graphs subject to uncertain edge failures, On Fault-Tolerant Low-Diameter Clusters in Graphs, Bounds for the frequency assignment problem, An adaptive multistart tabu search approach to solve the maximum clique problem, Solving the anti-covering location problem using Lagrangian relaxation, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, Diversification strategies in tabu search algorithms for the maximum clique problem, Metaheuristics: A bibliography, Algorithms for the maximum \(k\)-club problem in graphs, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, On biconnected and fragile subgraphs of low diameter, A variable neighborhood search for graph coloring., Combinatorial algorithms for the maximum \(k\)-plex problem, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments, A branch-and-price algorithm for the robust graph coloring problem, Finding large \(k\)-clubs in undirected graphs, An efficient local search for the feedback vertex set problem, Heuristics for finding \(k\)-clubs in an undirected graph, Multi-neighborhood tabu search for the maximum weight clique problem, Variable neighborhood search for the maximum clique, A study of ACO capabilities for solving the maximum clique problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Mining relevant information on the Web: a clique-based approach, Distance-Based Clique Relaxations in Networks: s-Clique and s-Club, The life span method -- a new variant of local search, Facets for node packing, Exact algorithms for the minimum \(s\)-club partitioning problem, Improving heuristics for the frequency assignment problem, Constructing a course schedule by solving a series of assignment type problems, An exact algorithm for the maximum \(k\)-club problem in an undirected graph, The maximum clique problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Algorithms for the maximum satisfiability problem
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- An exact algorithm for the maximum clique problem
- Expose-and-merge exploration and the chromatic number of a random graph
- On generating all maximal independent sets
- A new heuristic method for the flow shop sequencing problem
- Tabu search techniques. A tutorial and an application to neural networks
- Clique detection for nondirected graphs: Two new algorithms
- Geometric algorithms and combinatorial optimization
- Approximation algorithms for combinatorial problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Future paths for integer programming and links to artificial intelligence
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithms for maximum independent sets
- Determining the number of internal stability of a graph
- A global optimization approach for solving the maximum clique problem
- Cliques in random graphs
- Finding a Maximum Independent Set
- A Survey of Progress in Graph Theory in the Soviet Union
- Algorithm 457: finding all cliques of an undirected graph
- A branch and bound algorithm for the maximum clique problem
- A branch and bound algorithm for the maximum clique problem
