Journal
OPTIMIZATION IN THE REAL WORLD: TOWARD SOLVING REAL-WORLD OPTIMIZATION PROBLEMS
Volume 13, Issue -, Pages 79-96Publisher
SPRINGER-VERLAG TOKYO
DOI: 10.1007/978-4-431-55420-2_5
Keywords
Computational homology; Persistent homology; Optimal cycles; Linear programming
Categories
Ask authors/readers for more resources
In this work, we discuss the problem of finding optimal cycles for homology groups of simplicial complexes and for persistent homology of filtrations. We review the linear programming formulation of the optimal homologous cycle problem and its extension to allow for multiple cycles. By inserting these linear programming problems into the persistent homology algorithm, we are able to compute an optimal cycle, that has been optimized at birth, for every persistent interval in the persistent diagram.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available