A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem

DOI10.1007/978-3-642-21527-8_66zbMath1346.90823OpenAlexW158372591MaRDI QIDQ3091541

Francesco Carrabs, Gennaro Parlato, Raffaele Cerulli, Monica Gentili

Publication date: 9 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_66

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22)

Related Items (4)

New formulations and branch-and-cut procedures for the longest induced path problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem

This page was built for publication: A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem