Vertex-disjoint packing of two steiner trees: Polyhedra and branch-and-cut

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 439-452

  Uchoa, Eduardo ^a   de Aragão, Marcus Poggi ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; ELECTRIC CONNECTORS; GEOMETRY; TREES (MATHEMATICS);

BRANCH AND CUT; ELECTRICAL CONNECTION; FACET-DEFINING INEQUALITIES; REALISTIC MODEL; SEPARATION ALGORITHMS; STEINER TREES; TERMINAL SETS; VERTEX DISJOINT;

INTEGER PROGRAMMING;

EID: 22644450728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_33     Document Type: Conference Paper

References (8)

1. M. Grötschel, A. Martin and R. Weismantel, Packing Steiner Trees: polyhedral investigations, Mathematical Programming, Vol. 72, 101-123, 1996.
2. M. Grötschel, A. Martin and R. Weismantel, Packing Steiner Trees: a cutting plane algorithm and computational results, Mathematical Programming, Vol. 72, 125-145, 1996.
3. B. Korte, H. Prömel and A. Steger, Steiner Trees in VLSI-Layout, in B. Korte, L. Lovász, H. Prömel, A. Schrijver (Eds.) “Paths, Flows and VLSI-Layout”, Springer- Verlag, Berlin, 1989.
4. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.
5. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
6. M. Poggi de Aragão and E. Uchoa, The γ-Connected Assignment Problem, To appear in European Journal of Operational Research, 1998.
7. Y. Shiloach, A Polynomial Solution to the Undirected Two Paths Problem, Journal of the ACM, Vol. 27, No.3, 445-456, 1980.
8. S. Thienel, ABACUS - A Branch-And-Cut System, PhD thesis, Universität zu Köln, 1995.