论文信息 - A note on the generalized Steiner tree polytope

A note on the generalized Steiner tree polytope

Abstract The generalized steiner tree problem (GSTP) is a variant of the classical Steiner tree problem (STP), in which a family of node clusters is given and the tree must span at least one node for each cluster. This note introduces a lifting procedure for obtaining polyhedral information on GSTP from polyhedral results of STP. New classes of facet-defining inequalities are presented.

J. Salazar | Juan José Salazar

[1] Matteo Fischetti,et al. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[2] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.

[3] S. Chopra. On the spanning tree polyhedron , 1989 .

[4] Martin Grötschel,et al. Packing Steiner trees: polyhedral investigations , 1996, Math. Program..

[5] A. Volgenant,et al. Some generalizations of the steiner problem in graphs , 1987, Networks.

[6] M. R. Rao,et al. The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[7] M. R. Rao,et al. The Steiner tree problem II: Properties and classes of facets , 1994, Math. Program..

[8] Matteo Fischetti,et al. Facets of two Steiner arborescence polyhedra , 1991, Math. Program..

[9] Michel X. Goemans,et al. A catalog of steiner tree formulations , 1993, Networks.

[10] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.

[11] Laurence A. Wolsey,et al. Trees and Cuts , 1983 .

[12] T. Koch,et al. Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[13] Michel X. Goemans,et al. The Steiner tree polytope and related polyhedra , 1994, Math. Program..