Massive quasi-clique detection, Lecture Notes in Computer Science, vol.2286, pp.598-612, 2002. ,
GRASP with path-relinking for the maximum diversity problem, Lecture Notes in Computer Science, vol.3503, pp.558-569, 2005. ,
Fast local search for the maximum independent set problem, Journal of Heuristics, vol.18, issue.4, pp.525-547, 2012. ,
Optimal results and tight bounds for the maximum diversity problem, Foundations of Computing and Decision Sciences, vol.34, issue.2, pp.73-86, 2009. ,
Comparing local search metaheuristics for the maximum diversity problem, Journal of the Operational Research Society, vol.62, issue.2, pp.266-280, 2011. ,
Complexity and approximation: combinatorial optimization problems and their approximability properties, 1999. ,
A branch and bound algorithm for the maximum clique problem, Methods and Models of Operations Research, vol.34, issue.3, pp.207-217, 1990. ,
Graph domination, coloring and cliques in telecommunications, Handbook of Optimization in Telecommunications, pp.865-890, 2006. ,
Clique relaxations in social network analysis: The maximum k-plex problem, Operations Research, vol.59, issue.1, pp.133-142, 2011. ,
Computer Vision, 1982. ,
Habitat dispersion in forest planning and the stable set problem, Operations Research, vol.40, issue.1, pp.14-21, 1992. ,
The reactive tabu search, ORSA Journal on Computing, vol.6, issue.2, pp.126-140, 1994. ,
Reactive local search for the maximum clique problem, Algorithmica, vol.29, issue.4, pp.610-637, 2001. ,
Reactive and dynamic local search for the Max-Clique problem: engineering effective building blocks, Computers & Operations Research, vol.37, issue.3, pp.534-542, 2010. ,
Breakout local search for maximum clique problems, Computers & Operations Research, vol.40, issue.1, pp.192-206, 2013. ,
Mining the largest quasiclique in human protein interactome, Proceedings of IEEE International Conference on Artificial Intelligence Systems, pp.194-199, 2009. ,
Different formulations for solving the heaviest k-subgraph problem, Information Systems and Operational Research, vol.43, issue.3, pp.171-186, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-01124973
Mining market data: a network approach, Computers & Operations Research, vol.33, issue.11, pp.3171-3184, 2006. ,
The maximum clique problem, Handbook of combinatorial optimization, pp.1-74, 1999. ,
Approximating the maximum weight clique using replicator dynamics, IEEE Transactions on Neural Networks, vol.11, issue.6, pp.1228-1241, 2000. ,
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics, vol.159, issue.17, pp.1954-1970, 2011. ,
The max quasi-independent set problem, Journal of Combinatorial Optimization, vol.23, issue.1, pp.94-117, 2012. ,
Exact and approximation algorithms for densest k-subgraph, Lecture Notes in Computer Science, vol.7748, pp.114-125, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00874586
An exact algorithm for the maximum k-club problem in an undirected graph, European Journal of Operational Research, vol.138, pp.21-28, 2002. ,
New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979. ,
Variable neighborhood search for the heaviest k-subgraph. Computers & Operations Research, vol.36, pp.2885-2891, 2009. ,
Fast heuristic for large scale covering location problems, Computers & Operations Research, vol.29, issue.6, pp.651-665, 2002. ,
On effectively finding maximal quasi-cliques in graphs, Lecture Notes in Computer Science, vol.5313, pp.41-55, 2008. ,
, , 2003.
, Hyper-heuristics: an emerging direction in modern search technology
Handbook of Meta-heuristics, pp.457-474 ,
Maximum stable set formulations and heuristics based on continuous optimization, Mathematical Programming, vol.94, issue.1, pp.137-166, 2002. ,
A new trust region technique for the maximum weight clique problem, Discrete Applied Mathematics, vol.154, issue.15, pp.2080-2096, 2006. ,
Maximum independent set and related problems, with applications, 2003. ,
EWLS: A new local search for minimum vertex cover, Proc. of AAAI-10, pp.45-50, 2010. ,
Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Artificial Intelligence, vol.175, issue.9, pp.1672-1696, 2011. ,
Branch and bound algorithms for the maximum clique problem under a unified framework, Journal of the Brazilian Computer Society, vol.18, issue.2, pp.137-151, 2012. ,
An exact algorithm for the maximum clique problem, Operations Research Letters, vol.9, issue.6, pp.375-382, 1990. ,
How good are genetic algorithms at finding large cliques: an experimental study, 1993. ,
Examination timetabling: algorithmic strategies and applications, Journal of Operational Research Society, vol.47, issue.3, pp.373-383, 1996. ,
Extended clique initialisation in examination timetabling, Journal of Operational Research Society, vol.52, issue.5, pp.538-544, 2001. ,
Some experiments with simulated annealing for coloring graphs, European Journal of Operational Research, vol.32, issue.2, pp.260-266, 1987. ,
Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses, Proceedings of the 54th Annual Symposium on Foundations of Computer Science, pp.370-379, 2013. ,
Approximation algorithms for dispersion problems, Journal of Algorithms, vol.38, issue.2, pp.438-465, 2001. ,
Available bandwidth in multirate and multihop wireless ad hoc networks, IEEE Journal on Selected Areas in Communications, vol.28, issue.3, pp.299-307, 2010. ,
Fixed-parameter and approximation algorithms: a new look, Lecture Notes in Computer Science, vol.8246, pp.110-122, 2013. ,
Graph theory, An algorithmic approach, 1975. ,
A heuristic approach for the max-min diversity problem based on max-clique, Computers & Operations Research, vol.36, issue.8, pp.2429-2433, 2009. ,
A cutting-plane approach to the edgeweighted maximal clique problem, European Journal of Operational Research, vol.69, issue.1, pp.121-130, 1993. ,
Maximum cliques in protein structure comparison, Lecture Notes in Computer Science, vol.6049, pp.106-117, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00422198
Modelling robust flight gate scheduling as a clique partitioning problem, Transportation Science, vol.42, issue.3, pp.292-301, 2008. ,
Towards optimal lower bounds for clique and chromatic number, Theoretical Computer Science, vol.299, issue.1-3, pp.537-584, 2003. ,
Greedy and heuristic algorithms for codes and colorings, IEEE Transactions on Information Theory, vol.44, issue.1, pp.382-388, 1998. ,
Simple and Fast: Improving a branch-and-bound algorithm for maximum clique, Lecture Notes in Computer Science, vol.2461, pp.485-498, 2002. ,
The dense k-subgraph problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001. ,
Approximating maximum clique by removing subgraphs, SIAM Journal on Discrete Mathematics, vol.18, issue.2, pp.219-225, 2004. ,
A method for member selection of cross-functional teams using the individual and collaborative performances, European Journal of Operational Research, vol.203, issue.3, pp.652-661, 2010. ,
Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. S, Johnson & Trick, pp.619-652, 1996. ,
Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, vol.63, issue.3, pp.437-461, 1996. ,
Stabulus: a technique for finding stable sets in large graphs with tabu search, Computing, vol.42, issue.1, pp.35-44, 1989. ,
Hybrid heuristics for the maximum diversity problem, Computational Optimization and Applications, vol.44, issue.3, pp.411-426, 2009. ,
Solving the maximum clique problem using a tabu search approach, Annals of Operations Research, vol.41, issue.4, pp.385-403, 1993. ,
Black box scatter search for general classes of binary optimization problems, Computers & Operations Research, vol.37, issue.11, pp.1977-1986, 2010. ,
Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem, Journal of Heuristics, vol.10, issue.2, pp.135-152, 2004. ,
Simple ingredients leading to very efficient heuristics for the maximum clique problem, Journal of Heuristics, vol.14, issue.6, pp.587-612, 2008. ,
An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-Hard problems in graph and set theory via clique finding, IEEE Transactions on Systems, Man, and Cybernetics, vol.38, issue.3, pp.645-666, 2008. ,
Variable neighborhood search for the maximum clique, Discrete Applied Mathematics, vol.145, issue.1, pp.117-125, 2004. ,
Memetic algorithms in discrete optimization, Studies in Computational Intelligence, vol.379, pp.73-94, 2012. ,
Clique is hard to approximate within n 1??, Acta Mathematica, vol.182, issue.1, pp.105-142, 1999. ,
Maxima for graphs and a new proof of a theorem of Turán, Canadian Journal of Mathematics, vol.17, pp.533-540, 1965. ,
Adaptive, restart, randomized greedy heuristics for maximum clique, Journal of Heuristics, vol.7, issue.6, pp.565-585, 2001. ,
Impact of interference on multi-hop wireless network performance, Wireless Networks, vol.11, issue.4, pp.471-487, 2005. ,
General swap-based multiple neighborhood tabu search for finding maximum independent set, Engineering Application of Artificial Intelligence, vol.37, pp.20-33, 2015. ,
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, 1996. ,
Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972. ,
An effective local search for the maximum clique problem, Information Processing Letters, vol.95, issue.5, pp.503-511, 2005. ,
Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science, pp.600-609, 2001. ,
An improved branch and bound algorithm for the maximum clique problem. MATCH -Communications in Mathematical and in Computer Chemistry, vol.58, pp.569-590, 2007. ,
A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search, Proceedings of The Forth International Conference on Engineering Computational Technology, pp.202-208, 2004. ,
Problems of optimization: an exact algorithm for finding a maximum clique optimized for dense graphs, Proceedings of the Estonian Academy of Sciences, vol.54, pp.79-86, 2005. ,
Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems, Geographical Analysis, vol.19, issue.4, pp.315-329, 1987. ,
An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem, Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp.128-133, 2010. ,
Iterated greedy for the maximum diversity problem, European Journal of Operational Research, vol.214, issue.1, pp.31-38, 2011. ,
An application of tabu search heuristic for the maximum edge weighted subgraph problem, Annals of Operational Research, vol.117, issue.1-4, pp.175-190, 2003. ,
Edge projection and the maximum cardinality stable set problem, DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp.249-261, 1996. ,
An augmentation algorithm for the maximum weighted stable set problem, Computational Optimization and Applications, vol.14, issue.3, pp.367-381, 1999. ,
Genetic, iterated and multistart local search for the maximum clique problem, Lecture Notes in Computer Science, vol.2279, pp.112-121, 2002. ,
Heuristics and metaheuristics for the maximum diversity problem, Journal of Heuristics, vol.19, issue.4, pp.591-615, 2013. ,
A branch and bound algorithm for the maximum diversity problem, European Journal of Operational Research, vol.200, issue.1, pp.36-44, 2010. ,
Extended and discretized formulations for the maximum clique problem, Computers & Operations Research, vol.37, issue.7, pp.1348-1358, 2011. ,
Cliques with maximum/minimum edge neighborhood and neighborhood density, Computers & Operations Research, vol.39, issue.3, pp.594-608, 2012. ,
Speeding up branch and bound algorithms for solving the maximum clique problem, Journal of Global Optimization, vol.59, issue.1, pp.1-21, 2013. ,
A complementary pivoting approach to the maximum weight clique problem, SIAM Journal on Optimization, vol.12, issue.4, pp.928-948, 2001. ,
Classifying molecular sequences using a linkage graph with their pairwise similarities, Theoretical Computer Science, vol.210, issue.2, pp.305-325, 1999. ,
Multi-threading a state-of-the-art maximum clique algorithm, Algorithms, vol.6, issue.4, pp.618-635, 2013. ,
, Vertex packing: structural properties and algorithms. Mathematical Programming, vol.8, pp.232-248, 1975.
A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1, pp.197-207, 2002. ,
A new algorithm for the maximum-weight clique problem, Electronic Notes in Discrete Mathematics, vol.3, pp.153-156, 1999. ,
A branch-and-bound approach for maximum quasi-cliques, Annals of Operations Research, vol.216, issue.1, pp.145-161, 2014. ,
Iterated tabu search for the maximum diversity problem, Applied Mathematics and Computation, vol.189, issue.1, pp.371-383, 2007. ,
The maximum clique problem, Journal of Global Optimization, vol.4, issue.3, pp.301-328, 1994. ,
An extended formulation approach to the edge-weighted maximal clique problem, European Journal of Operational Research, vol.95, issue.3, pp.671-682, 1996. ,
Clique relaxation models in social network analysis, Handbook of Optimization in Complex Networks: Theory and Applications. Springer Optimization and Its Applications, vol.58, pp.143-162, 2012. ,
On the maximum quasi-clique problem, Discrete Applied Mathematics, vol.161, issue.1-2, pp.244-257, 2013. ,
On mining cross-graph quasi-cliques, Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp.228-238, 2005. ,
Exact Algorithms for Maximum Clique: A Computational Study, Algorithms, vol.5, issue.4, pp.545-587, 2012. ,
Phased local search for the maximum clique problem, Journal of Combinatorial Optimization, vol.12, issue.3, pp.303-323, 2006. ,
Dynamic local search for the maximum clique problem, Journal of Artificial Intelligence Research, vol.25, pp.159-185, 2006. ,
Approximating the maximum vertex/edge weighted clique using local search, Journal of Heuristics, vol.14, issue.2, pp.117-134, 2008. ,
Cooperating local search for the maximum clique problem, Journal of Heuristics, vol.17, issue.2, pp.181-199, 2011. ,
Identification of a 5-protein biomarker molecular signature for predicting alzheimer's disease, Plos One, vol.3, issue.9, p.3111, 2008. ,
Heuristic and special case algorithms for dispersion problems, Operations Research, vol.42, issue.2, pp.299-310, 1994. ,
A branch and cut solver for the maximum stable set problem, Journal of Combinatorial Optimization, vol.21, issue.4, pp.434-457, 2011. ,
A tutorial on branch and cut algorithms for the maximum stable set problem, International Transactions in Operational Research, vol.19, issue.1-2, pp.161-199, 2012. ,
Solving the maximum clique problem with constraint programming, Lecture Notes in Computer Science, vol.2833, pp.634-648, 2003. ,
A stochastic local search approach to vertex cover, Proceedings of the 30th German Conference on Artificial Intelligence, pp.412-426, 2007. ,
A branch-and-cut algorithm for the maximum cardinality stable set problem, Operations Research Letters, vol.28, issue.2, pp.63-74, 2001. ,
Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007. ,
An improved bit parallel exact maximum clique algorithm, Optimization Letters, vol.7, issue.3, pp.467-479, 2013. ,
An exact bitparallel algorithm for the maximum clique problem, Computers & Operations Research, vol.38, issue.2, pp.571-581, 2011. ,
, , 2006.
Dual quadratic estimates in polynomial and Boolean programming, Annals of Operations Research, vol.25, issue.1, pp.163-168, 1990. ,
New heuristics for the maximum diversity problem, Journal of Heuristics, vol.13, issue.4, pp.315-336, 2007. ,
A hybrid heuristic for the maximum clique problem, Journal of Heuristics, vol.12, issue.1-2, pp.5-22, 2006. ,
A hybrid evolutionary approach to maximum weight clique problem, International Journal of Computational Intelligence Research, vol.2, issue.4, pp.349-355, 2006. ,
A study of aco capabilities for solving the maximum clique problem, Journal of Heuristics, vol.12, issue.3, pp.158-180, 2006. ,
New facets and a branch-and-cut algorithm for the weighted clique problem, European Journal of Operational Research, vol.154, issue.1, pp.57-70, 2004. ,
An efficient branch-and-bound algorithm for finding a maximum clique, Lecture Notes in Computer Science, vol.2731, pp.278-289, 2003. ,
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Journal of Global Optimization, vol.37, issue.1, pp.95-111, 2007. ,
A simple and faster branch-andbound algorithm for finding a maximum clique, Lecture Notes in Computer Science, vol.5942, pp.191-203, 2010. ,
Solving group technology problem via clique partitioning, International Journal of Flexible Manufacturing Systems, vol.18, issue.2, pp.77-97, 2006. ,
A tabu search based memetic algorithm for the maximum diversity problem, Engineering Applications of Artificial Intelligence, vol.27, pp.103-114, 2014. ,
Combinatorial branch-and-bound for the maximum weight independent set problem, 2006. ,
An iterative approach to robust and integrated aircraft routing and crew scheduling, Computers & Operations Research, vol.37, issue.5, pp.833-844, 2010. ,
Coloring large graphs based on independent set extraction, Computers & Operations Research, vol.39, issue.2, pp.283-290, 2012. ,
An effective heuristic algorithm for sum coloring of graphs, Computers & Operations Research, vol.39, issue.7, pp.1593-1600, 2012. ,
Multi-neighborhood tabu search for the maximum weight clique problem, Annals of Operations Research, vol.196, issue.1, pp.611-634, 2012. ,
An adaptive multistart tabu search approach to solve the maximum clique problem, Journal of Combinatorial Optimization, vol.26, issue.1, pp.86-108, 2011. ,
A hybrid metaheuristic method for the maximum diversity problem, European Journal of Operational Research, vol.231, issue.2, pp.452-464, 2013. ,
Scalable Maximum Clique Computation Using MapReduce, IEEE 29th International Conference on Data Engineering, pp.74-85, 2013. ,
A simple model to generate hard satisfiable instances, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp.337-342, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00396466
Random constraint satisfaction: easy generation of hard (satisfiable) instances, Artificial intelligence, vol.171, issue.8-9, pp.514-534, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00191088
A TCNN filter algorithm to maximum clique problem, Neurocomputing, vol.72, issue.4-6, pp.1312-1318, 2009. ,
Out-of-core coherent closed quasi-clique mining from large dense graph databases, ACM Transactions on Database System, vol.32, issue.2, p.13, 2007. ,
An evolutionary algorithm with guided mutation for the maximum clique problem, IEEE Transactions on Evolutionary Computation, vol.9, issue.2, pp.192-200, 2005. ,
Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the 38th ACM Symposium on Theory of Computing, pp.681-690, 2006. ,