On a class of branching problems in broadcasting and distribution
- Authors
- Rosenthal, Edward C.; Chaudhry, Sohail S.; Choi, In-Chan; Jang, Jinbong
- Issue Date
- 8월-2012
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Keywords
- Distribution; Logistics; Network flows; Graph theory
- Citation
- COMPUTERS & OPERATIONS RESEARCH, v.39, no.8, pp.1793 - 1799
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTERS & OPERATIONS RESEARCH
- Volume
- 39
- Number
- 8
- Start Page
- 1793
- End Page
- 1799
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/107838
- DOI
- 10.1016/j.cor.2011.06.001
- ISSN
- 0305-0548
- Abstract
- We introduce the following network optimization problem: given a directed graph with a cost function on the arcs, demands at the nodes, and a single source s, find the minimum cost connected subgraph from s such that its total demand is no less than lower bound D. We describe applications of this problem to disaster relief and media broadcasting, and show that it generalizes several well-known models including the knapsack problem, the partially ordered knapsack problem, the minimum branching problem, and certain scheduling problems. We prove that our problem is strongly NP-complete and give an integer programming formulation. We also provide five heuristic approaches, illustrate them with a numerical example, and provide a computational study on both small and large sized, randomly generated problems. The heuristics run efficiently on the tested problems and provide solutions that, on average, are fairly close to optimal. (C) 2011 Elsevier Ltd. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.