A note on the generalized Steiner tree polytope

DOI10.1016/S0166-218X(99)00200-0zbMath0947.90065WikidataQ126470290 ScholiaQ126470290MaRDI QIDQ1962028

Juan José Salazar

Publication date: 30 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polyhedronSteiner treefacets

Mathematics Subject Classification ID

Trees (05C05) Operations research and management science (90B99)

Related Items

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems, The connected facility location polytope, Solving Steiner trees: Recent advances, challenges, and perspectives, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Swap-vertex based neighborhood for Steiner tree problems, Solving group Steiner problems as Steiner problems., Some formulations for the group Steiner tree problem, Generalized network design problems., The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Unnamed Item

Uses Software

• SteinLib

Cites Work

• On the spanning tree polyhedron
• Facets of two Steiner arborescence polyhedra
• The Steiner tree polytope and related polyhedra
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The Steiner tree problem. II: Properties and classes of facets
• Packing Steiner trees: Polyhedral investigations
• Trees and Cuts
• Some generalizations of the steiner problem in graphs
• Technical Note—A Note on Zero-One Programming
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Solving Steiner tree problems in graphs to optimality
• The symmetric generalized traveling salesman polytope
• A catalog of steiner tree formulations
• Steiner tree problems