swMATH2534MaRDI QIDQ15073FDOQ15073
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/030505489090048C
Cited In (19)
- The maximum clique problem
- Reduction of indefinite quadratic programs to bilinear programs
- NISPOC
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Reductions for the stable set problem
- A multi-KP modeling for the maximum-clique problem
- GIDEON
- Algorithm 457
- Sugal
- A fast algorithm for the maximum weight clique problem
- Constructing a course schedule by solving a series of assignment type problems
- Solving transportation problems with nonlinear side constraints with tabu search
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Solving the maximum clique problem using a tabu search approach
- 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
- Finding maximum cliques in arbitrary and in special graphs
- On the Shannon capacity of triangular graphs
This page was built for software: TABARIS
