A polyhedral approach to the feedback vertex set problem
- Cite this paper as:
- Funke M., Reinelt G. (1996) A polyhedral approach to the feedback vertex set problem. In: Cunningham W.H., McCormick S.T., Queyranne M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg
Feedback problems consist of removing a minimal number of arcs or nodes of a directed or undirected graph in order to make it acyclic. In this paper we consider a special variant, namely the problem of finding a maximum weight node induced acyclic subdigraph. We discuss valid and facet defining inequalities for the associated polytope and present computational results with a branch-and-cut algorithm.
Unable to display preview. Download preview PDF.