TY - GEN A1 - Borndörfer, Ralf A1 - Neumann, Marika A1 - Pfetsch, Marc T1 - The Line Connectivity Problem N2 - This paper introduces the "line connectivity problem", a generalization of the Steiner tree problem and a special case of the line planning problem. We study its complexity and give an IP formulation in terms of an exponential number of constraints associated with "line cut constraints". These inequalities can be separated in polynomial time. We also generalize the Steiner partition inequalities. T3 - ZIB-Report - 08-31 KW - Steiner Tree Generalization Y1 - 2008 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1082 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-10820 SN - 1438-0064 ER -