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

DOI10.1016/S0305-0548(96)00091-3MaRDI QIDQ1370664zbMATH OpenFDO

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

Publication date 26 October 1997

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

Full work available at URL https://doi.org/10.1016/S0305-0548(96)00091-3

zbMATH Keywords

branch-and-boundcapacitated subtree of a tree problem

Mathematics Subject Classification ID

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

Recommendations

• Approximating capacitated tree-routings in networks
• Approximating Capacitated Tree-Routings in Networks
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• scientific article; zbMATH DE number 3963210
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Automata, Languages and Programming
• Tree knapsack approaches for local access network design
• Exact approaches for solving a covering problem with capacitated subtrees
• Efficient algorithms for a constrained k-tree core problem in a tree network

Cites work

• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• A unified limited column generation approach for facility location problems on trees
• An Algorithm for Large Zero-One Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem
• Fast Approximation Algorithms for Knapsack Problems
• Heuristic algorithms for the multiple knapsack problem
• scientific article; zbMATH DE number 3989108 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Optimizing constrained subtrees of trees

Cited in

(2)

• Tree knapsack approaches for local access network design
• scientific article; zbMATH DE number 3963210 (Why is no real title available?)

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks

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