The bottleneck selected‐internal and partial terminal Steiner tree problems
From MaRDI portal
Publication:4642405
DOI10.1002/net.21713zbMath1390.90101OpenAlexW2537099718MaRDI QIDQ4642405
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21713
combinatorial optimizationnetwork designbottleneck Steiner treebottleneck partial terminal Steiner tree problembottleneck selected-internal Steiner tree problemfacility allocation in networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (1)
This page was built for publication: The bottleneck selected‐internal and partial terminal Steiner tree problems
