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

A hybrid heuristic for the maximum clique problem

By Singh Alok   Gupta Ashok  

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

Springer Publishing Company

Access to resources Recommend Favorite

Solving 0-1 knapsack problem by continuous ACO algorithm

By Changdar Chiranjit   Mahapatra G.S.   Pal Rajat Kumar  

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 3-4, 2013-11 ,pp. : 333-349

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