A polyhedral approach to the feedback vertex set problem

DOI10.1007/3-540-61310-2_33zbMath1415.90063OpenAlexW1581643485MaRDI QIDQ4645941

Meinrad Funke, Gerhard Reinelt

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_33

zbMATH Keywords

primal heuristicinteger programming formulationincidence vectorcycle inequalityfeedback problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Almost always observable hybrid systems, Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem, Solving the feedback vertex set problem on undirected graphs, A constraint programming approach to cutset problems, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Algorithms for finding maximum transitive subtournaments, Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs, Introduction to ABACUS -- a branch-and-cut system, Unnamed Item, Fixed-parameter tractability for subset feedback set problems with parity constraints

Uses Software

• CPLEX

Cites Work

• On the feedback vertex set problem for a planar graph
• Weakly bipartite graphs and the max-cut problem
• Introduction to ABACUS -- a branch-and-cut system
• On the acyclic subgraph polytope
• General topological results on the construction of a minimum essential set of a directed graph
• Robust linear algorithms for cutsets
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item