Cited in
(19)- Reduction of indefinite quadratic programs to bilinear programs
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Solving the maximum clique problem using a tabu search approach
- A multi-KP modeling for the maximum-clique problem
- Reductions for the stable set problem
- Metaheuristics: A bibliography
- Constructing a course schedule by solving a series of assignment type problems
- Diversification strategies in tabu search algorithms for the maximum clique problem
- A fast algorithm for the maximum weight clique problem
- On the Shannon capacity of triangular graphs
- Solving transportation problems with nonlinear side constraints with tabu search
- NISPOC
- GIDEON
- Algorithm 457
- Sugal
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Finding maximum cliques in arbitrary and in special graphs
- The maximum clique problem
This page was built for software: TABARIS
