A New Solver for the Minimum Weighted Vertex Cover Problem

DOI10.1007/978-3-319-33954-2_28zbMath1475.68362OpenAlexW2441524006MaRDI QIDQ2815127

Sven Koenig, T. K. Satish Kumar, Hong Xu

Publication date: 27 June 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33954-2_28

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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) Signed and weighted graphs (05C22)

Related Items (1)

The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP

Uses Software

• CP-nets
• lp_solve
• Gurobi
• Cliquer
• Potassco
• NuMVC
• CircuitTSAT

This page was built for publication: A New Solver for the Minimum Weighted Vertex Cover Problem