Journal article
Minimax Flow Tree Problems
Networks, Vol.54(3), pp.117-129
10/2009
DOI: 10.1002/net.20313
Abstract
We examine a class of problems that seeks to find tree-structured networks that minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters that can represent distance, flow volume, and delivery deadlines. Derived through variations in problem parameters, we present 17 different problems and discuss their worst-case complexities. Fourteen of the problems are new to the literature. We show that some of the problems are N P-Complete and others are polynornially solvable. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(3), 117-129 2009
Details
- Title: Subtitle
- Minimax Flow Tree Problems
- Creators
- Hui Chen - University of IowaAnn Campbell - Univ Iowa, Dept Management Sci, Tippie Coll Business, Iowa City, IA 52242 USABarrett Thomas - Univ Iowa, Dept Management Sci, Tippie Coll Business, Iowa City, IA 52242 USAArie Tamir - Tel Aviv University
- Resource Type
- Journal article
- Publication Details
- Networks, Vol.54(3), pp.117-129
- Publisher
- Wiley
- DOI
- 10.1002/net.20313
- ISSN
- 0028-3045
- eISSN
- 1097-0037
- Number of pages
- 13
- Grant note
- 0237726 / National Science Foundation; National Science Foundation (NSF)
- Language
- English
- Date published
- 10/2009
- Academic Unit
- Bus Admin College; Business Analytics
- Record Identifier
- 9984380497702771
Metrics
1 Record Views