On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms

DOI10.1145/3040718.3040726zbMath1365.68397OpenAlexW2604936630MaRDI QIDQ5738854

Frank Neumann, Tobias Friedrich, Mojgan Pourhassan

Publication date: 13 June 2017

Published in: Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3040718.3040726

zbMATH Keywords

integer linear programmingevolutionary algorithmvertex cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (4)

Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem ⋮ Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem

This page was built for publication: On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms