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

Author： Maslov Evgeny   Batsyn Mikhail   Pardalos Panos  

Publisher： Springer Publishing Company

ISSN： 0925-5001

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

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

Related content

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

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

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

By Tomita Etsuji   Kameda Toshikatsu  

Journal of Global Optimization, Vol. 37, Iss. 1, 2007-01 ,pp. : 95-111

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

Fuzzy algorithms of problem solving

By Chorayan O.G.   Chorayan G.O.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 9-10, 2002-11 ,pp. : 1300-1305

Emerald Group Publishing Ltd

Access to resources Recommend Favorite