Abstract
A rather general observation is that sufficiently small instances can be solved optimally while large instances cannot. This leads to the following simple idea to attack the discrete time-cost tradeoff problem. Suppose a large network is given, as for example the one in Figure 16.1. Loosely speaking, we will decompose the network into sufficiently smaller networks (see Figure 17.1) such that each of the subnetworks can be handled well (see also Akkan et al. [4] and [5]).
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kimms, A. (2001). Network Decomposition. In: Mathematical Programming and Financial Objectives for Scheduling Projects. International Series in Operations Research & Management Science, vol 38. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1453-4_17
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1453-4_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5561-8
Online ISBN: 978-1-4615-1453-4
eBook Packages: Springer Book Archive