On a class of branching problems in broadcasting and distribution

DOI10.1016/J.COR.2011.06.001zbMath1251.90062OpenAlexW1965950112MaRDI QIDQ1761092

In-Chan Choi, Sohail S. Chaudhry, Jinbong Jang, Edward C. Rosenthal

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.cor.2011.06.001

zbMATH Keywords

distributiongraph theorynetwork flowslogistics

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A greedy approximation algorithm for the group Steiner problem
• On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Approximation Algorithms for Certain Scheduling Problems
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Approximation Algorithms for Directed Steiner Problems
• On the approximability of some network design problems

This page was built for publication: On a class of branching problems in broadcasting and distribution