A polyhedral approach to the feedback vertex set problem-Reference-Cited by-同舟云学术

A polyhedral approach to the feedback vertex set problem

Published:1996 Issue: Volume: Page:445-459
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Funke Meinrad,Reinelt Gerhard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61310-2_33.pdf

Reference16 articles.

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

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relaxing the Observability Notion;H-Systems;2023

2. Almost always observable hybrid systems;Nonlinear Analysis: Hybrid Systems;2020-05

3. Algorithms for finding maximum transitive subtournaments;Journal of Combinatorial Optimization;2014-09-20

4. Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs;Integer Programming and Combinatorial Optimization;2014

5. Feedback Set Problems;Encyclopedia of Optimization;2012-02-24