A fast and effective algorithm for the feedback arc set problem

DOI10.1023/A:1011315014322zbMath0972.68633OpenAlexW1564197095MaRDI QIDQ5944363

Youssef G. Saab

Publication date: 19 November 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011315014322

zbMATH Keywords

acyclic subgraphconsistent inequalitiesfeedback set

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Related Items (4)

Tight Localizations of Feedback Sets ⋮ MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS ⋮ Capacity inverse minimum cost flow problem ⋮ Exact localisations of feedback sets

This page was built for publication: A fast and effective algorithm for the feedback arc set problem