The Steiner tree problem. II: Properties and classes of facets

DOI10.1007/BF01582574MaRDI QIDQ1330903zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 10 August 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582574

zbMATH Keywords

facetsfacial structurepolyhedronSteiner tree polyhedron

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Programming involving graphs or networks (90C35)

Recommendations

• Steiner trees and polyhedra
• Packing Steiner trees: Further facets
• The Steiner tree polytope and related polyhedra
• Facets of two Steiner arborescence polyhedra
• The Steiner tree problem on graphs: inapproximability results

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Steiner trees, partial 2–trees, and minimum IFI networks
• The traveling salesman problem on a graph and some related integer polyhedra

Cited in

(27)

• 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
• Binary Steiner trees: structural results and an exact solution approach
• On survivable network polyhedra
• Generalized network design problems.
• A note on the generalized Steiner tree polytope
• On the exact separation of cover inequalities of maximum-depth
• Stronger MIP formulations for the Steiner forest problem
• Coordinated cutting plane generation via multi-objective separation
• Towards optimizing the deployment of optical access networks
• Chvátal-Gomory cuts for the Steiner tree problem
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Optimal relay node placement in delay constrained wireless sensor network design
• scientific article; zbMATH DE number 4156212 (Why is no real title available?)
• scientific article; zbMATH DE number 1775115 (Why is no real title available?)
• Polyhedral study of the connected subgraph problem
• An Exact Algorithm for the Steiner Forest Problem
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Distance transformation for network design problems
• A partition-based relaxation for Steiner trees
• Discrete relaxations of combinatorial programs
• Steiner trees and polyhedra
• A comparison of Steiner tree relaxations
• Solving Steiner trees: Recent advances, challenges, and perspectives
• New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
• Intermediate integer programming representations using value disjunctions

This page was built for publication: The Steiner tree problem. II: Properties and classes of facets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330903)