The One-Terminal TELPAK Problem

DOI10.1287/OPRE.19.1.156MaRDI QIDQ5624962zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.1.156

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Communication theory (94A05)

Recommendations

• On the computational difficulty of the terminal connection problem
• scientific article; zbMATH DE number 3916357
• The 1-steiner tree problem
• On single courier problem
• scientific article; zbMATH DE number 6025258
• scientific article; zbMATH DE number 958366
• The 1-Neighbour Knapsack Problem
• On the point-to-point connection problem
• scientific article; zbMATH DE number 3979080

Cited in

(12)

• Optimal planning of network structures within an exchange area
• On the complexity of the one-terminal network design problem
• Topological design of telecommunication networks --- local access design methods
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• Single source single-commodity stochastic network design
• The network redesign problem for access telecommunications networks
• scientific article; zbMATH DE number 764467 (Why is no real title available?)
• Some problems in discrete optimization
• Approximating some network design problems with node costs
• Tree network design avoiding congestion
• Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
• An optimization method for multiplexer locations

This page was built for publication: The One-Terminal TELPAK Problem

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