Abstract
In this chapter, we develop an exact algorithmic scheme for the solution of network design problems which is based on iterative (dis)aggregation of the underlying network graph. For the ease of exposition, we use a very basic problem setting for the derivation of our framework, namely a canonical single-commodity network expansion problem without routing costs and a single module per arc (cf. the hierarchy of network design problems given in Section 2.3.1). Two remarks are important about this choice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
