An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks

DOI10.1016/S0305-0548(96)00091-3zbMath0894.90061MaRDI QIDQ1370664

Seong-Lyun Kim, Geon Cho, Dong X. Shaw

Publication date: 26 October 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundcapacitated subtree of a tree problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Linear programming (90C05)

Related Items

Tree knapsack approaches for local access network design

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Heuristic algorithms for the multiple knapsack problem
• A unified limited column generation approach for facility location problems on trees
• Optimizing constrained subtrees of trees
• Fast Approximation Algorithms for Knapsack Problems
• An Algorithm for Large Zero-One Knapsack Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Computing Partitions with Applications to the Knapsack Problem
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees