A greedy randomized adaptive search procedure for the feedback vertex set problem
From MaRDI portal
Publication:1288478
DOI10.1023/A:1009736921890zbMath0954.90042OpenAlexW1506768432MaRDI QIDQ1288478
Mauricio G. C. Resende, Tianbing Qian, Panos M. Pardalos
Publication date: 9 February 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009736921890
heuristicsinteger programmingcombinatorial optimizationGRASPlocal searchprobabilistic algorithmfeedback vertex setcomputer implementation
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
A heuristic method to rectify intransitive judgments in pairwise comparison matrices ⋮ Graphical requirements for multistationarity in reaction networks and their verification in BioModels ⋮ A spin glass approach to the directed feedback vertex set problem ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ Shortest paths in almost acyclic graphs ⋮ A constraint programming approach to cutset problems ⋮ A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
This page was built for publication: A greedy randomized adaptive search procedure for the feedback vertex set problem
