Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.

Eduardo Uchoa Marcus Poggi de Aragão

Published in: IPCO (1999)

Keyphrases

steiner tree
packing problem
undirected graph
minimum spanning tree
shortest path
facility location
special case
directed graph
integer programming
linear programming relaxation
approximation algorithms
traveling salesman problem