A note on the generalized Steiner tree polytope
From MaRDI portal
Publication:1962028
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A catalog of steiner tree formulations
- Facets of two Steiner arborescence polyhedra
- On the spanning tree polyhedron
- Packing Steiner trees: Polyhedral investigations
- Solving Steiner tree problems in graphs to optimality
- Some generalizations of the steiner problem in graphs
- Steiner tree problems
- Technical Note—A Note on Zero-One Programming
- 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
- The symmetric generalized traveling salesman polytope
- Trees and Cuts
Cited in
(14)- Solving group Steiner problems as Steiner problems.
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- The connected facility location polytope
- Swap-vertex based neighborhood for Steiner tree problems
- Generalized network design problems.
- The Steiner cycle polytope
- Generalised \(k\)-Steiner tree problems in normed planes
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Some formulations for the group Steiner tree problem
- A note on Steiner tree games
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- scientific article; zbMATH DE number 2230214 (Why is no real title available?)
- Steiner trees in general nonuniform orientations
- Solving Steiner trees: Recent advances, challenges, and perspectives
This page was built for publication: A note on the generalized Steiner tree polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962028)