Diversification strategies in tabu search algorithms for the maximum clique problem

DOI10.1007/BF02125454zbMath0851.90099MaRDI QIDQ1919840

Michel Gendreau, Patrick Soriano

Publication date: 25 November 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

tabu searchmaximum clique problemrandomly generated test problemsdiversification strategies

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Detecting robust cliques in graphs subject to uncertain edge failures ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ Metaheuristics: A bibliography ⋮ A tabu search algorithm for the covering design problem ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ A tabu search algorithm for self-healing ring network design. ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ A metaheuristic to solve a location-routing problem with nonlinear costs ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ Diversification strategies in local search for a nonbifurcated network loading problem

Uses Software

• TABARIS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• An exact algorithm for the maximum clique problem
• Approximation algorithms for combinatorial problems
• The maximum clique problem
• A study of diversification strategies for the quadratic assignment problem
• Future paths for integer programming and links to artificial intelligence
• A user's guide to tabu search
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• Solving the maximum clique problem using a tabu search approach
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Finding a Maximum Clique in an Arbitrary Graph
• Tabu Search Applied to the Quadratic Assignment Problem
• On the Shannon capacity of a graph
• A Tabu Search Heuristic for the Vehicle Routing Problem
• 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

This page was built for publication: Diversification strategies in tabu search algorithms for the maximum clique problem