The Line Connectivity Problem

Please always quote using this URN: urn:nbn:de:0297-zib-10820
  • 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.

Download full text files

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Author:Ralf Borndörfer, Marika Neumann, Marc E. Pfetsch
Document Type:ZIB-Report
Tag:Steiner Tree Generalization
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization
Date of first Publication:2008/08/14
Series (Serial Number):ZIB-Report (08-31)
Published in:Appeared in: Operations Reserach Proceedings 2008. Bernhard Fleischmann ... (eds.) Springer 2009, pp. 557-562

$Rev: 13581 $