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

ISSN： 0925-5001

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

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

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

A branch-and-bound approach for maximum quasi-cliques

By Mahdavi Pajouh Foad Miao Zhuqi Balasundaram Balabhaskar

Annals of Operations Research, Vol. 216, Iss. 1, 2014-05 ,pp. : 145-161

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

By Ronconi Débora

Annals of Operations Research, Vol. 138, Iss. 1, 2005-09 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite