Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs

DOI10.1007/978-3-319-12691-3_46zbMath1433.05298OpenAlexW587362032MaRDI QIDQ2942437

Neng Fan, Mehdi Golari

Publication date: 11 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_46

zbMATH Keywords

connected componentsinteger programmingminimum spanning treeminimum spanning forestnetwork vulnerability analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Cost optimized design for the local wind turbine grid of an onshore wind farm ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles

This page was built for publication: Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs