Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut

✍ Scribed by Eduardo Uchoa; Marcus Poggi de Aragão

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 301 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011434

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-Trees Optimal T-Join and Integral Pa

Two-Trees Optimal T-Join and Integral Packing of T-Cuts

✍ E. Korach 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let \(G\) be an undirected graph, \(T\) an even subset of vertices and \(F\) an optimal \(T\)-join, which is a forest of two trees. The main theorem of this paper characterizes the cases, where \((G, T)\) has an optimal packing of \(T\)-cuts which is integral. This theorem unifies and generalizes a