An exact method for the minimum feedback arc set problem
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for the acyclic subgraph problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Design for Directed Graphs with Minimum Diameter
- A fast and effective heuristic for the feedback arc set problem
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A Greedy Heuristic for the Set-Covering Problem
- A Minimax Theorem for Directed Graphs
- A suggested computation for maximal multi-commodity network flows
- Approximating minimum feedback sets and multicuts in directed graphs
- Beating the random ordering is hard: every ordering CSP is approximation resistant
- Breaking cycles for minimizing crossings
- Combinatorial algorithms for feedback problems in directed graphs
- Computational Complexity
- Depth-First Search and Linear Graph Algorithms
- Design to Minimize Diameter on Building-Block Network
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- Exact localisations of feedback sets
- Finding a minimum feedback arc set in reducible flow graphs
- Finding All the Elementary Circuits of a Directed Graph
- Fundamentals of parameterized complexity
- Generalized de Bruijn digraphs
- Graph layout for applications in compiler construction
- scientific article; zbMATH DE number 1693470 (Why is no real title available?)
- scientific article; zbMATH DE number 432770 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 3902393 (Why is no real title available?)
- scientific article; zbMATH DE number 3495588 (Why is no real title available?)
- scientific article; zbMATH DE number 3575628 (Why is no real title available?)
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- scientific article; zbMATH DE number 825126 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Input-Output Analysis
- Introduction to algorithms.
- New and improved bounds for the minimum set cover problem
- On enumerating all minimal solutions of feedback problems
- On the acyclic subgraph polytope
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
- On the power of unique 2-prover 1-round games
- On the ratio of optimal integral and fractional covers
- Optimal Weighted Ancestry Relationships
- Optimization, approximation, and complexity classes
- Packing directed circuits fractionally
- Random Graphs
- Ranking Tournaments
- Reducibility among combinatorial problems
- SCIP: solving constraint integer programs
- Solution of a Large-Scale Traveling-Salesman Problem
- The Complexity of Enumeration and Reliability Problems
- The linear ordering problem with cumulative costs
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Cited in
(26)- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Minimal arc-sets spanning dicycles
- Tight upper bounds for minimum feedback arc sets of regular graphs
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
- A spin glass approach to the directed feedback vertex set problem
- Finding a minimum feedback arc set in reducible flow graphs
- On the minimum dummy-arc problem
- scientific article; zbMATH DE number 1526336 (Why is no real title available?)
- scientific article; zbMATH DE number 825126 (Why is no real title available?)
- The feedback arc set problem with triangle inequality is a vertex cover problem
- Tight localizations of feedback sets
- A fast and effective algorithm for the feedback arc set problem
- The Minimal Feedback Arc Set Problems*
- Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
- Effective Computation of a Feedback Arc Set Using PageRank
- Virtual network function reconfiguration in 5G networks: an optimization perspective
- Efficient heuristics to compute minimal and stable feedback arc sets
- A fast and effective heuristic for the feedback arc set problem
- Minimal and stable feedback arc sets and graph centrality measures
- On the delay time in the enumeration of all simple cycles of a directed graph
- PACE solver description: DAGer -- cutting out cycles with MaxSAT
- Finding small feedback arc sets on large graphs
- Exact localisations of feedback sets
- The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization
- PACE solver description: UzL exact solver for one-sided crossing minimization
- PACE solver description: arcee
This page was built for publication: An exact method for the minimum feedback arc set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102057)
