Integration of Routing Costs into the Aggregation Scheme
The preceding chapter saw the development of an aggregation-based algorithmic scheme to solve large-scale network design problems. Its main idea is the aggregation of single nodes of the network graph to components. Apart from reducing the size of the network design problems, it also features a reduction of (continuous) symmetry in the problem by neglecting the routing decisions within the components.
Unable to display preview. Download preview PDF.