A Branch and Cut Algorithm for a Steiner Tree-Star Problem
From MaRDI portal
Publication:5690260
DOI10.1287/ijoc.8.3.194zbMath0871.90100OpenAlexW2143061299MaRDI QIDQ5690260
Youngho Lee, Jennifer K. Ryan, Steve Y. Chiu
Publication date: 15 January 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.8.3.194
telecommunications networksdegree constrained node-weighted Steiner tree problemSteiner tree-star problem
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items
Approximate robust optimization for the connected facility location problem, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Exact algorithms for budgeted prize-collecting covering subgraph problems, A two-level off-grid electric distribution problem on the continuous space, Branch-and-price approaches for the network design problem with relays, A learning based algorithm for drone routing, A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract), Branch-and-cut-and-price for capacitated connected facility location, An algorithmic framework for the exact solution of tree-star problems, MIP models for connected facility location: a theoretical and computational study, Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty, The General Steiner Tree-Star problem.
