STABULUS: A technique for finding stable sets in large graphs with tabu search
From MaRDI portal
Publication:1262136
DOI10.1007/BF02243141zbMATH Open0685.68056OpenAlexW1555834419MaRDI QIDQ1262136FDOQ1262136
Authors: C. Friden, Dominique De Werra, Alain Hertz 
Publication date: 1989
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243141
Recommendations
Cites Work
- Future paths for integer programming and links to artificial intelligence
- A graph coloring algorithm for large scheduling problems
- Finding a Maximum Clique in an Arbitrary Graph
- On generating all maximal independent sets
- Using tabu search techniques for graph coloring
- Title not available (Why is that?)
- Some experiments with simulated annealing for coloring graphs
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
Cited In (38)
- A study of ACO capabilities for solving the maximum clique problem
- The maximum clique problem
- A variable neighborhood search for graph coloring.
- The life span method -- a new variant of local search
- An efficient tabu search procedure for the \(p\)-median problem
- Polynomially solvable cases for the maximum stable set problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- A branch-and-price algorithm for the robust graph coloring problem
- Genetic and hybrid algorithms for graph coloring
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Mining relevant information on the Web: a clique-based approach
- Clustered maximum weight clique problem: algorithms and empirical analysis
- A survey of local search methods for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- A new extension of local search applied to the Dial-A-Ride problem
- Breakout local search for maximum clique problems
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- Greedy randomized adaptive search procedures
- Constructing a course schedule by solving a series of assignment type problems
- Solving transportation problems with nonlinear side constraints with tabu search
- The tabu search metaheuristic: How we used it
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Multi-neighborhood tabu search for the maximum weight clique problem
- A New Composite Algorithm for Clustering Problems
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- A cooperative search method for the \(k\)-coloring problem
- Tabu search for graph partitioning
- A metaheuristic algorithm for large maximum weight independent set problems
- A new binary (17,4,5) constant weight code
- Solving the maximum clique problem using a tabu search approach
- Metaheuristics: A bibliography
- Genetic algorithms and tabu search: Hybrids for optimization
- A review on algorithms for maximum clique problems
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Learning driven three-phase search for the maximum independent union of cliques problem
- Title not available (Why is that?)
This page was built for publication: STABULUS: A technique for finding stable sets in large graphs with tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262136)
