8313 2022 eng 154 159 conferenceobject 0 -- 2021-08-11 -- Balanced separators are node sets that split the graph into size bounded components. They find applications in different theoretical and practical problems. In this paper we discuss how to find a minimum set of balanced separators in node weighted graphs. Our contribution is a new and exact algorithm that solves Minimum Balanced Separators by a sequence of Hitting Set problems. The only other exact method appears to be a mixed-integer program (MIP) for the edge weighted case. We adapt this model to node weighted graphs and compare it to our approach on a set of instances, resembling transit networks. It shows that our algorithm is far superior on almost all test instances. Operations Research Proceedings 2021 1438-0064 urn:nbn:de:0297-zib-83138 https://doi.org/10.1007/978-3-031-08623-6_24 publish yes Ralf Borndörfer William Surau Stephan Schwartz William Surau 21-25 Mathematics of Computing OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING Borndörfer, Ralf Schwartz, Stephan TOLLCONTROLOPT Surau, William Network Optimization https://opus4.kobv.de/opus4-zib/files/8313/ZIB-Report-21-25.pdf