A hybrid heuristic for the maximum clique problem

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.12, Iss.1-2, 2006-03, pp. : 5-22

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A study of ACO capabilities for solving the maximum clique problem

By Solnon Christine Fenet Serge

Journal of Heuristics, Vol. 12, Iss. 3, 2006-05 ,pp. : 155-180

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid heuristic for inventory routing problem

By Ganesh N. Ramkumar P. Subramanian T.T. Narendran K.

Journal of Historical Research in Marketing, Vol. 1, Iss. 1, 2011-10 ,pp. : 45-63

Inderscience Publishers

Access to resources Recommend Favorite

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

By Grosso A. Locatelli M. Croce F. Della

Journal of Heuristics, Vol. 10, Iss. 2, 2004-03 ,pp. : 135-152

Springer Publishing Company

Access to resources Recommend Favorite

Branch and bound algorithms for the maximum clique problem under a unified framework

By Carmo Renato Züge Alexandre

Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. : 137-151

Springer Publishing Company

Access to resources Recommend Favorite

Speeding up branch and bound algorithms for solving the maximum clique problem

By Maslov Evgeny Batsyn Mikhail Pardalos Panos

Journal of Global Optimization, Vol. 59, Iss. 1, 2014-05 ,pp. : 1-21

Springer Publishing Company

Access to resources Recommend Favorite