I have directed weighted graph. I have to find a set of edges with minimal sum of their weights that without the set graph becomes acyclic. I can call lp solver multiple times.
I'm kind off lost on this one. The first thing that I thought of was to have variable x ∈ {0,1} for each edge and write a condition for each possible cycle that at least one edge has to be in the set. But that is really really slow.