Efficient heuristics to compute minimal and stable feedback arc sets

DOI10.1007/s10878-024-01209-8MaRDI QIDQ6646752

Claudia Cavallaro, Mario Pavone, Vincenzo Cutello

Publication date: 3 December 2024

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

zbMATH Keywords

heuristicsoptimization problemexperimental analysisminimal feedback arc setlinear arrangement of vertices

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast and effective heuristic for the feedback arc set problem
• Dense and sparse graph partition
• Exact localisations of feedback sets
• On the hardness of approximating minimum vertex cover
• A Minimax Theorem for Directed Graphs
• Reducibility among Combinatorial Problems
• Feedback Arc Set
• Tight Localizations of Feedback Sets
• An Exact Method for the Minimum Feedback Arc Set Problem

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)