A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.9, Iss.5, 2003-11, pp. : 401-427

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 least-squares minimum-cost network flow algorithm

By Gopalakrishnan Balaji Kong Seunghyun Barnes Earl Johnson Ellis Sokol Joel

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 119-140

Springer Publishing Company

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J. Kanj I.A.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

Minimum‐cost virtual machine migration strategy in datacenter

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 17, 2015-12 ,pp. : 5177-5187

John Wiley & Sons Inc

Access to resources Recommend Favorite

An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem

By Shyu Shyong Yin Peng-Yeng Lin Bertrand

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 283-304

Springer Publishing Company

Access to resources Recommend Favorite

Minimum-cost sensor arrangement for achieving wanted coverage lifetime

By Wang Jie Zhong Ning

International Journal of Sensor Networks, Vol. 3, Iss. 3, 2008-05 ,pp. : 165-174

Inderscience Publishers

Access to resources Recommend Favorite