The Line Connectivity Problem
Please always quote using this URN:urn:nbn:de:0296-matheon-6016
- 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.
Author: | Ralf Borndörfer, Marika Neumann, Marc E. Pfetsch |
---|---|
URN: | urn:nbn:de:0296-matheon-6016 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2009/07/21 |
Release Date: | 2009/07/21 |
Tag: | |
Institute: | Technische Universität Berlin |
Zuse Institute Berlin (ZIB) | |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization |
Preprint Number: | 625 |