Abstract
In this chapter we consider the minimum network synthesis problem with non-simultaneous single commodity flow requirements (or NSSC for short). We distinguish between the two applications of this problem, namely the restoration and the multi-hour applications, since we prove that some classes do not have the same complexity. As the multi-hour problem was covered by Gomory and Hu [32] [33], and by Sridhar and Chandrasekaran [75], we mainly study the Line Restoration (LR) problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wynants, C. (2001). Single Commodity Flow Requirements. In: Network Synthesis Problems. Combinatorial Optimization, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3349-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3349-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4843-4
Online ISBN: 978-1-4757-3349-5
eBook Packages: Springer Book Archive