A polyhedral approach to the feedback vertex set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 445-459

  Funke, Meinrad ^a   Reinelt, Gerhard ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS;

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; FACET-DEFINING INEQUALITIES; FEEDBACK PROBLEMS; FEEDBACK VERTEX SET PROBLEMS; POLYHEDRAL APPROACH; POLYTOPES; UNDIRECTED GRAPH;

INTEGER PROGRAMMING;

EID: 84947905897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_33     Document Type: Conference Paper

References (16)

1. Cplex. Using the Cplex callable library and Cplex mixed integer library (1994). Cplex Inc.
2. Grötschel, M., Jünger, M., Reinelt, G.: On the acyclic subgraph polytope. Mathematical Programming, 33 (1985) 28-42
3. Grötschel, M., Pulleyblank, W.: Weakly bipartite graphs and the max-cut problem. Operations Research Letters, 1 (1981) 23-27
4. Hackbusch, W.: On the feedback vertex set problem for a planar graph. Technical report (1994). Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, D-24098 Kiel, Germany
5. Jünger, M.: Polyhedral Combinatorics and the acyclic subdigraph problem., Research and exposition in mathematics 7 (1985). Heldermann Verlag, Berlin
6. Jünger, M., Reinelt, G., Thienel, S.: Practical problem solving with cutting plane algorithms in combinatorial optimization. In Cook, W., Lovász, L., Seymour, P., editors, Combinatorial Optimization, DIMACS series in Discrete Mathematics and Theoretical Computer Science 20 (1995) 111-152
7. Karp, R.: Reducibility among combinatorial problems. In Miller, R., Thatcher, J., editors, Complexity of Computer Computations, (1971) 85-103. Plenum Press, New York
8. Kevorkian, A.: General topological results on the construction of a minimum essential set of a directed graph. IEEE Transactions on Circuits and Systems, CAS-27(4) (1980) 293-304
9. Kunzmann, A. Wunderlich, H.: An analytical approach to the partial scan problem. Journal of electronic testing: Theory and Applications, 1 (1990) 163-174
10. Lovász, L. Randomized Algorithms in Combinatorial Optimization. In Cook, W., Lovász, L., Seymour, P., editors, Combinatorial Optimization, DIMACS series in Discrete Mathematics and Theoretical Computer Science 20 (1995) 153-179
11. Monien, B. Schulz, R.: Pour approximation algorithms for the feedback vertex set problem. In Graphtheoretic concepts in computer science, Proc. 7th Conf. Linz/Austria (1985) 315-326
12. Rosen, B.: Robust linear algorithms for cutsets. Journal of algorithms, 3 (1982) 205-217
13. Smith, W., Walford, R.: The identification of a minimal feedback vertex set of a directed graph. IEEE Transactions on circuits and systems, CAS-22(1) (1975) 15
14. Speckenmeyer, E.: Untersuchungen zum Feedback Vertex Set Problem in un-gerichteten Graphen. Theoretische Informatik Bericht 16 (1983). Universitat Paderborn
15. Stamm, H.: On feedback problems in planar digraphs. Graph-theoretic concepts in computer science, Proc. Int. Workshop, Berlin/Germany 1990, Lect. Notes Comput. Sci. 484 (1992) 79-89. Springer Verlag
16. Thienel, S.: ABACUS-A Branch And CUt System. PhD thesis (1995). Ange-wandte Mathematik und Informatik, Universitat zu Köln