A fast and effective algorithm for the feedback arc set problem

Journal of Heuristics

Volumn 7, Issue 3, 2001, Pages 235-250

  Saab, Youssef ^a  

^a UNIVERSITY OF MISSOURI   (United States)

Author keywords

Acyclic subgraph; Consistent inequalities; Feedback set

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

ACYCLIC SUBGRAPH; CONSISTENT INEQUALITIES; DYNAMIC CLUSTERING; FEEDBACK ARC SET PROBLEM; MINIMUM BISECTION PROBLEM;

ALGORITHMS;

EID: 0035338537     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011315014322     Document Type: Article

References (24)

1. Approximation algorithms for the maximum acyclic subgraph problem
2. Advanced ordering and manipulation techniques for binary decision diagrams
3. A new approach to minimizing the frontwidth in finite element calculations
4. A heuristic for the feedback arc set problem
5. A fast and effective heuristic for the feedback arc set problem
6. Heuristics for the feedback arc set problem
7. A new approach to the maximum flow problem
8. Minimum feedback arc and vertex sets of a directed graph
9. A minimax equality for directed graphs
10. A minimax theorem for directed graphs
11. Estimating the complexity of synthesized designs from FSM specifications
12. Automated system partitioning for synthesis of multi-chip modules
13. Finding minimum feedback arc set in reducible flow graphs
14. Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits
15. Post-analysis-based clustering dramatically improves the fiduccia-mattheyses algorithm
16. A fast and robust network bisection algorithm
17. Combinatorial optimization by stochastic evolution
18. Optimal ranking of tournaments
19. A study of asynchronous logical feedback networks
20. Minimum feedback arc sets for a directed graph