Efficient heuristics to compute minimal and stable feedback arc sets

DOI10.1007/S10878-024-01209-8MaRDI QIDQ6646752FDO

Authors Claudia Cavallaro, Vincenzo Cutello, Mario Pavone

Publication date 3 December 2024

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

heuristicsexperimental analysisoptimization problemminimal feedback arc setlinear arrangement of vertices

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A fast and effective heuristic for the feedback arc set problem
• The Minimal Feedback Arc Set Problems^*
• scientific article; zbMATH DE number 825126
• An exact method for the minimum feedback arc set problem
• Finding a minimum feedback arc set in reducible flow graphs

Cites work

• scientific article; zbMATH DE number 432770 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A Minimax Theorem for Directed Graphs
• A fast and effective heuristic for the feedback arc set problem
• An exact method for the minimum feedback arc set problem
• Dense and sparse graph partition
• Exact localisations of feedback sets
• Feedback arc set. A history of the problem and algorithms
• On the hardness of approximating minimum vertex cover
• Reducibility among combinatorial problems
• Tight localizations of feedback sets

Cited in

(1)

• The Minimal Feedback Arc Set Problems^*

This page was built for publication: Efficient heuristics to compute minimal and stable feedback arc sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646752)