Journal article
Network design and dynamic routing under queueing demand
Zeitschrift für Operations Research, Vol.29(5), pp.141-160
11/1985
DOI: 10.1007/BF01920306
Abstract
Given a nonhierarchical network and time-varying flow requirements, the problem of determining optimal capacities is termed design; that of determining optimal flows as dynamic routing. We formulate a linear program to solve both simultaneously in the case of deterministic flow requirements. A probability distribution termed the Erlang Difference Distribution is derived from a queueing model to describe random flow requirements, and this case leads to a separable convex program that has a linear programming equivalent. Both linear programs are amenable to Dantzig-Wolfe decomposition, which reveals subproblems that yield to special techniques of solution.
Details
- Title: Subtitle
- Network design and dynamic routing under queueing demand
- Creators
- K. O. Kortanek - Carnegie Mellon UniversityG. G. Polak - Wheeling Jesuit University
- Resource Type
- Journal article
- Publication Details
- Zeitschrift für Operations Research, Vol.29(5), pp.141-160
- DOI
- 10.1007/BF01920306
- ISSN
- 0340-9422
- eISSN
- 1432-5217
- Number of pages
- 20
- Language
- English
- Date published
- 11/1985
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963099202771
Metrics
1 Record Views