The Steiner tree problem. II: Properties and classes of facets
From MaRDI portal
Publication:1330903
DOI10.1007/BF01582574zbMath0831.90115OpenAlexW2022912747MaRDI QIDQ1330903
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
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items
Optimal relay node placement in delay constrained wireless sensor network design, Chvátal-Gomory cuts for the Steiner tree problem, Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem, Solving Steiner trees: Recent advances, challenges, and perspectives, Coordinated cutting plane generation via multi-objective separation, New geometry-inspired relaxations and algorithms for the metric Steiner tree problem, A note on the generalized Steiner tree polytope, Polyhedral study of the connected subgraph problem, Stronger MIP formulations for the Steiner forest problem, Facets of two Steiner arborescence polyhedra, An Exact Algorithm for the Steiner Forest Problem, Intermediate integer programming representations using value disjunctions, Binary Steiner trees: structural results and an exact solution approach, A partition-based relaxation for Steiner trees, On survivable network polyhedra, Discrete relaxations of combinatorial programs, Steiner trees and polyhedra, A comparison of Steiner tree relaxations, Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Towards optimizing the deployment of optical access networks, Generalized network design problems., Distance Transformation for Network Design Problems, On the exact separation of cover inequalities of maximum-depth, The Steiner tree polytope and related polyhedra
Cites Work
