Abstract
Aggregation in the context of mixed-integer programming is a coarsening process that omits details but ensures a global view on the complete problem. There are two common reasons for performing aggregation of the problem data. Firstly, a problem instance may be too large for solving it at its full size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Bärmann, A. (2016). Motivation. In: Solving Network Design Problems via Decomposition, Aggregation and Approximation . Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-13913-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-658-13913-1_7
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-13912-4
Online ISBN: 978-3-658-13913-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)