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

Author： Mahdavi Pajouh Foad   Miao Zhuqi   Balasundaram Balabhaskar  

Publisher： Springer Publishing Company

ISSN： 0254-5330

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

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

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 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 parallel branch-and-bound methodfor cluster analysis

By Iyer L.S.   Aronson J.E.  

Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. : 65-86

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

Fast Hough Transform on Multiprocessors: A Branch and Bound Approach

By Guil N.   Zapata E.L.  

Journal of Parallel and Distributed Computing, Vol. 45, Iss. 1, 1997-08 ,pp. : 82-89

Academic Press

Access to resources Recommend Favorite