Minimum Weakly Fundamental Cycle Bases Are Hard To Find

Algorithmica ◽  
2007 ◽  
Vol 53 (3) ◽  
pp. 402-424 ◽  
Author(s):  
Romeo Rizzi
2005 ◽  
Vol 15 (1) ◽  
pp. 15-24 ◽  
Author(s):  
Leo Liberti ◽  
Edoardo Amaldi ◽  
Francesco Maffioli ◽  
Nelson Maculan

The problem of finding a fundamental cycle basis with minimum total cost in a graph arises in many application fields. In this paper we present some integer linear programming formulations and we compare their performances, in terms of instance size, CPU time required for the solution, and quality of the associated lower bound derived by solving the corresponding continuous relaxations. Since only very small instances can be solved to optimality with these formulations and very large instances occur in a number of applications, we present a new constructive heuristic and compare it with alternative heuristics.


Networks ◽  
2009 ◽  
Vol 53 (2) ◽  
pp. 191-205 ◽  
Author(s):  
Ekkehard Köhler ◽  
Christian Liebchen ◽  
Gregor Wünsch ◽  
Romeo Rizzi

2004 ◽  
Vol 17 ◽  
pp. 29-33 ◽  
Author(s):  
Edoardo Amaldi ◽  
Leo Liberti ◽  
Francesco Maffioli ◽  
Nelson Maculan

Author(s):  
Christian Liebchen ◽  
Gregor Wünsch ◽  
Ekkehard Köhler ◽  
Alexander Reich ◽  
Romeo Rizzi

Sign in / Sign up

Export Citation Format

Share Document